Sciweavers

450 search results - page 66 / 90
» Estimating Search Tree Size
Sort
View
MST
2011
205views Hardware» more  MST 2011»
13 years 2 months ago
Sublinear Time Algorithms for Earth Mover's Distance
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt ...
ICIP
2007
IEEE
14 years 9 months ago
Query-Driven Locally Adaptive Fisher Faces and Expert-Model for Face Recognition
We present a novel expert-model of Query-Driven Locally Adaptive (QDLA) Fisher faces for robust face recognition. For each query face, the proposed method first fits local Fisher ...
Yun Fu, Junsong Yuan, Zhu Li, Thomas S. Huang, Yin...
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
14 years 2 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
13 years 12 months ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
ICCV
1999
IEEE
14 years 9 months ago
Dynamic Feature Ordering for Efficient Registration
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
Tat-Jen Cham, James M. Rehg