1949 search results - page 308 / 390 » Random graphs on surfaces |
103
click to vote
IJCV
2011
14 years 6 months ago
2011
Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing str...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper we advocate a new technique for the fast identi cation of physical objects based on their physical unclonable features (surface microstructures). The proposed identi...
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
110
Voted
WWW
2005
ACM
16 years 17 days ago
2005
ACM
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...
101
click to vote
STOC
2009
ACM
16 years 15 days ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...