Articoli correlati a ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES...
ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS - Brossura
Sinossi
There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in clusters such that each one has diameter approximately less than a given value. The algorithm returns a tree structure called Antipole Tree in which the leaves are the final clusters. The second part of this book will present, GraphGrepVF, an application-independent method for querying a database of graphs in order to find all the occurrences of a given subgraph. Many applications in industry, science and engineering share this problem, and increasing the size of the database requires efficient structure searching algorithms.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 59,00
EUR 23,00 per la spedizione da Germania a U.S.A.
Destinazione, tempi e costiRisultati della ricerca per ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES...
Immagini fornite dal venditore
ANTIPOLE TREE INDEXING AND GRAPHGREPVF
Editore:
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10: 383836838X
ISBN 13: 9783838368382
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in clusters such that each one has diameter approximately less than a given value. The algorithm returns a tree structure called Antipole Tree in which the leaves are the final clusters. The second part of this book will present, GraphGrepVF, an application-independent method for querying a database of graphs in order to find all the occurrences of a given subgraph. Many applications in industry, science and engineering share this problem, and increasing the size of the database requires efficient structure searching algorithms. 156 pp. Englisch. Codice articolo 9783838368382
Quantità: 2 disponibili
Immagini fornite dal venditore
ANTIPOLE TREE INDEXING AND GRAPHGREPVF
Editore:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 383836838X
ISBN 13: 9783838368382
Nuovo
Brossura
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Reforgiato Recupero DiegoDiego Reforgiato is a Researcher at the DIIT of the Univ. of Catania. The support for this fellowship has been given by PROVIDEO, a Marie Curie Grant that Dr. Reforgiato won in 2008. From 4/1/2005 to 5/1/2008. Codice articolo 5417157
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
ANTIPOLE TREE INDEXING AND GRAPHGREPVF
Editore:
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10: 383836838X
ISBN 13: 9783838368382
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Neuware -There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in clusters such that each one has diameter approximately less than a given value. The algorithm returns a tree structure called Antipole Tree in which the leaves are the final clusters. The second part of this book will present, GraphGrepVF, an application-independent method for querying a database of graphs in order to find all the occurrences of a given subgraph. Many applications in industry, science and engineering share this problem, and increasing the size of the database requires efficient structure searching algorithms.Books on Demand GmbH, Überseering 33, 22297 Hamburg 156 pp. Englisch. Codice articolo 9783838368382
Quantità: 2 disponibili
Immagini fornite dal venditore
ANTIPOLE TREE INDEXING AND GRAPHGREPVF : DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS
Editore:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 383836838X
ISBN 13: 9783838368382
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in clusters such that each one has diameter approximately less than a given value. The algorithm returns a tree structure called Antipole Tree in which the leaves are the final clusters. The second part of this book will present, GraphGrepVF, an application-independent method for querying a database of graphs in order to find all the occurrences of a given subgraph. Many applications in industry, science and engineering share this problem, and increasing the size of the database requires efficient structure searching algorithms. Codice articolo 9783838368382
Quantità: 1 disponibili
Foto dell'editore
ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS
Editore:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 383836838X
ISBN 13: 9783838368382
Antico o usato
Paperback
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: Like New. Like New. book. Codice articolo ERICA790383836838X6
Quantità: 1 disponibili