Sciweavers

251 search results - page 46 / 51
» When Is Nearest Neighbors Indexable
Sort
View
PAMI
2011
13 years 2 months ago
Parallel Spectral Clustering in Distributed Systems
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen ...
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 11 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
EDBT
2009
ACM
164views Database» more  EDBT 2009»
14 years 3 days ago
Fast object search on road networks
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
ICCV
2009
IEEE
13 years 5 months ago
Incremental action recognition using feature-tree
Action recognition methods suffer from many drawbacks in practice, which include (1)the inability to cope with incremental recognition problems; (2)the requirement of an intensive...
Kishore K. Reddy, Jingen Liu, Mubarak Shah
CVPR
2009
IEEE
15 years 2 months ago
Reducing JointBoost-Based Multiclass Classification to Proximity Search
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...
Alexandra Stefan (University of Texas at Arlington...