3471 search results - page 334 / 695 » Obstacle Numbers of Graphs |
180
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
194
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
180
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
276
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
229
click to vote
FOCS
2006
IEEE
16 years 25 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...