Sciweavers

138 search results - page 27 / 28
» K-Nearest Neighbor Search for Moving Query Point
Sort
View
TRECVID
2008
13 years 9 months ago
National Institute of Informatics, Japan at TRECVID 2008
This paper reports our experiments for TRECVID 2008 tasks: high level feature extraction, search and contentbased copy detection. For the high level feature extraction task, we use...
Duy-Dinh Le, Xiaomeng Wu, Shin'ichi Satoh, Sheetal...
VLDB
1999
ACM
118views Database» more  VLDB 1999»
14 years 20 days ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
CIKM
2008
Springer
13 years 10 months ago
A measure for cluster cohesion in semantic overlay networks
Semantic overlay networks cluster peers that are semantically, thematically or socially close into groups by means of a rewiring procedure that is periodically executed by each pe...
Paraskevi Raftopoulou, Euripides G. M. Petrakis
AAAI
1998
13 years 9 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
14 years 8 months ago
Adaptive location constraint processing
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
Zhengdao Xu, Hans-Arno Jacobsen