Sciweavers

312 search results - page 49 / 63
» The Analysis of a Probabilistic Approach to Nearest Neighbor...
Sort
View
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 10 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
WACV
2007
IEEE
14 years 1 months ago
Probabilistic Hierarchical Face Model for Feature Localization
Facial feature localization is an important research area in both computer vision and pattern analysis. We present in this paper a hierarchical face model. It unifies both the gl...
Feng Tang, Jin Wang, Hai Tao, Qunsheng Peng
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
14 years 8 months ago
DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
Shan-Hung Wu, Kun-Ta Chuang, Chung-Min Chen, Ming-...
WWW
2005
ACM
14 years 8 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
CIKM
2007
Springer
14 years 1 months ago
Query expansion using probabilistic local feedback with application to multimedia retrieval
As one of the most effective query expansion approaches, local feedback is able to automatically discover new query terms and improve retrieval accuracy for different retrieval ...
Rong Yan, Alexander G. Hauptmann