6251 search results - page 892 / 1251 » Randomness, Computability, and Density |
208
click to vote
FOCS
2008
IEEE
16 years 2 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
225
click to vote
PODC
2004
ACM
16 years 1 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
203
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
352
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...
269
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
In this paper, we introduce a higher-order MRF optimization
framework. On the one hand, it is very general;
we thus use it to derive a generic optimizer that can be applied
to a...