Sciweavers

156 search results - page 15 / 32
» A Content-Addressable Network for Similarity Search in Metri...
Sort
View
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 7 months ago
Efficient k-NN search on vertically decomposed data
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...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
ADHOCNOW
2003
Springer
14 years 25 days ago
Space-Time Routing in Ad Hoc Networks
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destinat...
Henri Dubois-Ferrière, Matthias Grossglause...
SISAP
2010
IEEE
149views Data Mining» more  SISAP 2010»
13 years 6 months ago
On applications of parameterized hyperplane partitioning
The efficient similarity search in metric spaces is usually based on several low-level partitioning principles, which allow filtering of non-relevant objects during the search. I...
Jakub Lokoc, Tomás Skopal
AINA
2007
IEEE
14 years 1 months ago
Using Web Directories for Similarity Measurement in Personal Name Disambiguation
In this paper, we target on the problem of personal name disambiguation in search results returned by personal name queries. Usually, a personal name refers to several people. The...
Quang Minh Vu, Tomonari Masada, Atsuhiro Takasu, J...
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
14 years 1 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...