Sciweavers

1388 search results - page 238 / 278
» Querying Linguistic Trees
Sort
View
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 2 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
133
Voted
CVPR
1997
IEEE
16 years 2 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
110
Voted
CVPR
2007
IEEE
16 years 2 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
202
Voted
ICDE
2004
IEEE
110views Database» more  ICDE 2004»
16 years 1 months ago
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
Nick Koudas, Beng Chin Ooi, Heng Tao Shen, Anthony...
SIGMOD
2009
ACM
218views Database» more  SIGMOD 2009»
16 years 21 days ago
Exploring biomedical databases with BioNav
We demonstrate the BioNav system, a novel search interface for biomedical databases, such as PubMed. BioNav enables users to navigate large number of query results by categorizing...
Abhijith Kashyap, Vagelis Hristidis, Michalis Petr...