401 search results - page 77 / 81 » Sparse Quasi-Random Graphs |
122
click to vote
SPAA
2006
ACM
15 years 7 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
120
click to vote
SWAT
2004
Springer
15 years 6 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
128
click to vote
DAS
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we present a novel graph-based method for extracting handwritten text lines in monochromatic Arabic document images. Our approach consists of two steps Coarse text ...
140
Voted
NIPS
2001
15 years 2 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
129
click to vote
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
The matching and retrieval of 2D shapes is an important
challenge in computer vision. A large number of shape
similarity approaches have been developed, with the main
focus bein...