Sciweavers

2539 search results - page 241 / 508
» Updates for Structure Indexes
Sort
View
FOCS
2009
IEEE
15 years 11 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 7 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
CG
2011
Springer
14 years 10 months ago
IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions
We propose a compact, dimension-independent data structure for manifold, non-manifold and non-regular simplicial complexes, that we call the Generalized Indexed Data structure wit...
David Canino, Leila De Floriani, Kenneth Weiss
ALGORITHMICA
2010
153views more  ALGORITHMICA 2010»
15 years 7 months ago
Confluently Persistent Tries for Efficient Version Control
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...
Erik D. Demaine, Stefan Langerman, Eric Price
ICCV
2009
IEEE
1611views Computer Vision» more  ICCV 2009»
17 years 5 days ago
Packing bag-of-features
One of the main limitations of image search based on bag-of-features is the memory usage per image. Only a few million images can be handled on a single machine in rea- sonable ...
Herve Jegou, Matthijs Douze, Cordelia Schmid