1542 search results - page 207 / 309 » The metamathematics of random graphs |
111
click to vote
WAW
2004
Springer
15 years 7 months ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
124
click to vote
ASUNAM
2010
IEEE
15 years 3 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
117
click to vote
CVPR
2008
IEEE
16 years 3 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...
157
click to vote
FOCS
2006
IEEE
15 years 7 months 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...
133
click to vote
ESA
2005
Springer
15 years 7 months 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 ...