371 search results - page 42 / 75 » On Two-Dimensional Indexability and Optimal Range Search Ind... |
CICLING
2003
Springer
15 years 2 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
SSDBM
2010
IEEE
15 years 2 months ago
2010
IEEE
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
Recent methods based on interest points and local fingerprints have been proposed to perform robust CBCD (content-based copy detection) of images and video. They include two steps...