Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

Cohesive Subgraph Computation over Large Sparse Graphs, Lijun Chang; Lu Qin


Варианты приобретения
Цена: 6097.00р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: Есть  
При оформлении заказа до: 2026-06-01
Ориентировочная дата поставки: Июль
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Lijun Chang; Lu Qin
Название:  Cohesive Subgraph Computation over Large Sparse Graphs
ISBN: 9783030035983
Издательство: Springer
Классификация:



ISBN-10: 3030035980
Обложка/Формат: Hardcover
Страницы: 107
Вес: 0.35 кг.
Дата издания: 2018
Серия: Springer Series in the Data Sciences
Язык: English
Издание: 1st ed. 2018
Иллюстрации: 1 tables, color; 1 illustrations, color; 20 illustrations, black and white; xii, 107 p. 21 illus., 1 illus. in color.
Размер: 234 x 156 x 8
Читательская аудитория: Professional & vocational
Основная тема: Mathematics
Подзаголовок: Algorithms, Data Structures, and Programming Techniques
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание:
This book is considered the first extended survey on algorithms and techniques for efficient cohesive subgraph computation. With rapid development of information technology, huge volumes of graph data are accumulated. An availability of rich graph data not only brings great opportunities for realizing big values of data to serve key applications, but also brings great challenges in computation. Using a consistent terminology, the book gives an excellent introduction to the models and algorithms for the problem of cohesive subgraph computation. The materials of this book are well organized from introductory content to more advanced topics while also providing well-designed source codes for most algorithms described in the book.
This is a timely book for researchers who are interested in this topic and efficient data structure design for large sparse graph processing. It is also a guideline book for new researchers to get to know the area of cohesive subgraph computation.

Дополнительное описание: Introduction.- Linear Heap Data Structures.- Minimum Degree-based Core Decomposition.- Average Degree-based Densest Subgraph Computation.- Higher-order Structure-based Graph Decomposition.- Edge Connectivity-based Graph Decomposition.



Graph Theory and Sparse Matrix Computation

Автор: Alan George; John R. Gilbert; Joseph W.H. Liu
Название: Graph Theory and Sparse Matrix Computation
ISBN: 1461383714 ISBN-13(EAN): 9781461383710
Издательство: Springer
Рейтинг:
Цена: 14635.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This IMA Volume in Mathematics and its Appllcations GRAPH THEORY AND SPARSE MATRIX COMPUTATION is based on the proceedings of a workshop that was an integraI part of the 1991- 92 IMA program on "Applied Linear AIgebra." The purpose of the workshop was to bring together people who work in sparse matrix computation with those who conduct research in applied graph theory and grl: l, ph algorithms, in order to foster active cross-fertilization. We are grateful to Richard Brualdi, George Cybenko, Alan Geo ge, Gene Golub, Mitchell Luskin, and Paul Van Dooren for planning and implementing the year-Iong program. We espeeially thank Alan George, John R. Gilbert, and Joseph W.H. Liu for organizing this workshop and editing the proceedings. The finaneial support of the National Science Foundation made the workshop possible. A vner Friedman Willard Miller. Jr. PREFACE When reality is modeled by computation, linear algebra is often the con nec- tiori between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer. Efficiency demands that every possible advantage be exploited: sparse structure, advanced com- puter architectures, efficient algorithms. Therefore sparse matrix computation knits together threads from linear algebra, parallei computing, data struetures, geometry, and both numerieal and discrete algorithms.

Iterative Solution of Large Sparse Systems of Equations

Автор: Hackbusch
Название: Iterative Solution of Large Sparse Systems of Equations
ISBN: 3319284819 ISBN-13(EAN): 9783319284811
Издательство: Springer
Рейтинг:
Цена: 15855.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature.
The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms.
The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.
Large Sparse Numerical Optimization

Автор: T. F. Coleman
Название: Large Sparse Numerical Optimization
ISBN: 3540129146 ISBN-13(EAN): 9783540129141
Издательство: Springer
Рейтинг:
Цена: 2438.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Sparse Grid Quadrature in High Dimensions with Applications in Finance and Insurance

Автор: Markus Holtz
Название: Sparse Grid Quadrature in High Dimensions with Applications in Finance and Insurance
ISBN: 3642265634 ISBN-13(EAN): 9783642265631
Издательство: Springer
Рейтинг:
Цена: 13415.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book deals with the numerical analysis and efficient numerical treatment of high-dimensional integrals using sparse grids and other dimension-wise integration techniques with applications to finance and insurance.

Sparse Grids and Applications - Miami 2016

Автор: Garcke
Название: Sparse Grids and Applications - Miami 2016
ISBN: 3319754254 ISBN-13(EAN): 9783319754253
Издательство: Springer
Рейтинг:
Цена: 18294.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Direct Methods for Sparse Matrices

Автор: Duff I. S
Название: Direct Methods for Sparse Matrices
ISBN: 0198508387 ISBN-13(EAN): 9780198508380
Издательство: Oxford Academ
Рейтинг:
Цена: 19899.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The subject of sparse matrices has its root in such diverse fields as management science, power systems analysis, surveying, circuit theory, and structural analysis. Efficient use of sparsity is a key to solving large problems in many fields. This book provides both insight and answers for those attempting to solve these problems.

Sparse Grids and Applications - Miami 2016

Автор: Jochen Garcke; Dirk Pfl?ger; Clayton G. Webster; G
Название: Sparse Grids and Applications - Miami 2016
ISBN: 3030092275 ISBN-13(EAN): 9783030092276
Издательство: Springer
Рейтинг:
Цена: 18294.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Sparse grids are a popular tool for the numerical treatment of high-dimensional problems. Where classical numerical discretization schemes fail in more than three or four dimensions, sparse grids, in their different flavors, are frequently the method of choice. This volume of LNCSE presents selected papers from the proceedings of the fourth workshop on sparse grids and applications, and demonstrates once again the importance of this numerical discretization scheme. The articles present recent advances in the numerical analysis of sparse grids in connection with a range of applications including computational chemistry, computational fluid dynamics, and big data analytics, to name but a few.

Direct Methods for Sparse Matrices

Автор: O. Osterby; Z. Zlatev
Название: Direct Methods for Sparse Matrices
ISBN: 3540126767 ISBN-13(EAN): 9783540126768
Издательство: Springer
Рейтинг:
Цена: 2438.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Sparse Grids and Applications - Munich 2012

Автор: Jochen Garcke; Dirk Pfl?ger
Название: Sparse Grids and Applications - Munich 2012
ISBN: 3319381539 ISBN-13(EAN): 9783319381534
Издательство: Springer
Рейтинг:
Цена: 17684.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Sparse grids have gained increasing interest in recent years for the numerical treatment of high-dimensional problems.

The Sparse Fourier Transform

Автор: Hassanieh Haitham
Название: The Sparse Fourier Transform
ISBN: 1947487043 ISBN-13(EAN): 9781947487048
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 10352.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications. The fastest algorithm for computing the Fourier transform is the Fast Fourier Transform (FFT), which runs in near-linear time making it an indispensable tool for many applications. However, today, the runtime of the FFT algorithm is no longer fast enough especially for big data problems where each dataset can be few terabytes. Hence, faster algorithms that run in sublinear time, i.e., do not even sample all the data points, have become necessary.This book addresses the above problem by developing the Sparse Fourier Transform algorithms and building practical systems that use these algorithms to solve key problems in six different applications: wireless networks; mobile systems; computer graphics; medical imaging; biochemistry; and digital circuits.This is a revised version of the thesis that won the 2016 ACM Doctoral Dissertation Award.

Sparse grids and applications - stuttgart 2014

Название: Sparse grids and applications - stuttgart 2014
ISBN: 3319282603 ISBN-13(EAN): 9783319282602
Издательство: Springer
Рейтинг:
Цена: 12196.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Where classical numerical discretization schemes fail in more than three or four dimensions, sparse grids, in their different guises, are frequently the method of choice, be it spatially adaptive in the hierarchical basis or via the dimensionally adaptive combination technique.

Sparse Grids and Applications

Автор: Jochen Garcke; Michael Griebel
Название: Sparse Grids and Applications
ISBN: 3642426603 ISBN-13(EAN): 9783642426605
Издательство: Springer
Рейтинг:
Цена: 17074.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume of LNCSE is a collection of the papers from the proceedings of the workshop on sparse grids and its applications held in Bonn in May 2011. The selected articles present recent advances in the mathematical understanding and analysis of sparse grid discretization.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия