2859 search results - page 511 / 572 » Querying Complex Structured Databases |
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
PAMI
2006
13 years 8 months ago
2006
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
VLDB
2003
ACM
14 years 8 months ago
2003
ACM
Data warehousing systems integrate information from operational data sources into a central repository to enable analysis and mining of the integrated information. During the integ...
ICUIMC
2009
ACM
14 years 2 months ago
2009
ACM
Although documents have hundreds of thousands of unique words, only a small number of words are significantly useful for intelligent services. For this reason, feature extraction ...