6251 search results - page 241 / 1251 » Randomness, Computability, and Density |
158
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
149
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
128
Voted
STACS
2004
Springer
15 years 10 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
143
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Visual vocabulary construction is an integral part of the popular Bag-of-Features (BOF) model. When visual data scale up (in terms of the dimensionality of features or/an...
285
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...