Sciweavers

3341 search results - page 514 / 669
» On Bounded Queries and Approximation
Sort
View
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
15 years 11 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
CIKM
2008
Springer
15 years 7 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
LREC
2010
157views Education» more  LREC 2010»
15 years 7 months ago
Indexing Methods for Faster and More Effective Person Name Search
This paper compares several indexing methods for person names extracted from text, developed for an information retrieval system with requirements for fast approximate matching of...
Mark Arehart
NIPS
2008
15 years 7 months ago
Local Gaussian Process Regression for Real Time Online Model Learning
Learning in real-time applications, e.g., online approximation of the inverse dynamics model for model-based robot control, requires fast online regression techniques. Inspired by...
Duy Nguyen-Tuong, Matthias Seeger, Jan Peters
ICDE
2010
IEEE
282views Database» more  ICDE 2010»
16 years 5 months ago
Quantile-Based KNN Over Multi-Valued Objects
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Y...