Sciweavers

121 search results - page 16 / 25
» Anytime K-Nearest Neighbor Search for Database Applications
Sort
View
234
Voted
GIS
2003
ACM
16 years 2 months ago
Processing in-route nearest neighbor queries: a comparison of alternative approaches
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., locationbased services, advanced traveler information syst...
Shashi Shekhar, Jin Soung Yoo
109
Voted
DELOS
2004
15 years 3 months ago
Hyperdatabase Infrastructure for Management and Search of Multimedia Collections
Abstract. Nowadays, digital libraries are inherently dispersed over several peers of a steadily increasing network. Dedicated peers may provide specialized, computationally expensi...
Michael Mlivoncic, Christoph Schuler, Can Tür...
121
Voted
DEXA
2006
Springer
190views Database» more  DEXA 2006»
15 years 5 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 2 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
16 years 1 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias