Sciweavers

248 search results - page 34 / 50
» Nearest Neighbor Search on Multimedia Indexing Structures
Sort
View
MICAI
2004
Springer
14 years 1 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
3DIM
2003
IEEE
14 years 7 days ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
PVLDB
2008
163views more  PVLDB 2008»
13 years 8 months ago
AlvisP2P: scalable peer-to-peer text retrieval in a structured P2P network
In this paper we present the AlvisP2P IR engine, which enables efficient retrieval with multi-keyword queries from a global document collection available in a P2P network. In such...
Toan Luu, Gleb Skobeltsyn, Fabius Klemm, Maroje Pu...
DMSN
2004
ACM
14 years 2 months ago
KPT: a dynamic KNN query processing algorithm for location-aware sensor networks
An important type of spatial queries for sensor networks are K Nearest Neighbor (KNN) queries. Currently, research proposals for KNN query processing is based on index structures,...
Julian Winter, Wang-Chien Lee
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 8 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...