688 search results - page 89 / 138 » General Partitioning on Random Graphs |
120
click to vote
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
74
Voted
WWW
2006
ACM
16 years 1 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
102
Voted
KDD
2006
ACM
16 years 28 days ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
104
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
91
Voted
IV
2002
IEEE
15 years 5 months ago
2002
IEEE
We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Sprin...