Probabilistic Proximity Searching Algorithms Based on Compact Partitions

to connected objects

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch
Notes
In: String Processing and Information Retrieval / Laender, Alberto H. F.; Oliveira, Arlindo L. (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. - (Lecture Notes in Computer Science ; 2476). - S. 284-297. - ISBN 978-3-540-44158-8

Classification
Mathematik

Event
Veröffentlichung
(where)
Konstanz
(who)
Bibliothek der Universität Konstanz
(when)
2009
Creator

URN
urn:nbn:de:bsz:352-opus-69928
Rights
Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
25.03.2025, 1:56 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Show original at data provider

Associated

Time of origin

  • 2009

Other Objects (12)

Probabilistic Proximity Search Algorithms Based on Compact Partitions

Probabilistic Proximity Search Algorithms Based on Compact Partitions

Pivot Selection Techniques for Proximity Searching in Metric Spaces

Pivot Selection Techniques for Proximity Searching in Metric Spaces

Complexity and Partitions

Hochschulschrift

Complexity and Partitions

Irreducible Subcube Partitions

Irreducible Subcube Partitions

Complexity and partitions

Hochschulschrift | Online-Publikation

Complexity and partitions

Irreducible Subcube Partitions

Irreducible Subcube Partitions

Irregularities of partitions

Konferenzschrift | Kongress

Irregularities of partitions

Theorems in partitions.

Aufsatz

Theorems in partitions.

Theorem on partitions.

Aufsatz

Theorem on partitions.

Complexitiy and partitions

Hochschulschrift

Complexitiy and partitions

Dynamics of plane partitions

zweidimensionales bewegtes Bild

Dynamics of plane partitions

Notes on integer partitions

Notes on integer partitions

Related objects