1629 search results - page 152 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
WWW
2005
ACM
15 years 11 months 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...
PAMI
2007
14 years 9 months ago
2007
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
CASCON
1992
14 years 11 months ago
1992
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
85
Voted
ACSD
2004
IEEE
15 years 2 months ago
2004
IEEE
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...
108
click to vote
CVPR
2005
IEEE
16 years 7 days ago
2005
IEEE
This paper presents a novel and efficient algorithm for the 3D range to 2D image registration problem in urban scene settings. Our input is a set of unregistered 3D range scans an...