5606 search results - page 379 / 1122 » Randomization Techniques for Graphs. |
189
click to vote
ISCAPDCS
2003
15 years 8 months ago
2003
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graph...
188
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We present a novel structure learning method, Max Margin AND/OR Graph (MM-AOG), for parsing the human body into parts and recovering their poses. Our method represents the human b...
226
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
184
click to vote
ESA
2005
Springer
16 years 3 days ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
156
click to vote
ISAAC
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...