941 search results - page 76 / 189 » Efficient Testing of Large Graphs |
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
The rapid growth of the number of videos in YouTube provides enormous potential for users to find content of interest to them. Unfortunately, given the difficulty of searching vid...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
In order to artificially boost the rank of commercial pages in search engine results, search engine optimizers pay for links to these pages on other websites. Identifying paid lin...
103
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...