4 search results - page 1 / 1 » Approximation algorithm for k-node connected subgraphs via c... |
STOC
2004
ACM
14 years 5 months ago
2004
ACM
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
CVPR
2010
IEEE
13 years 2 months ago
2010
IEEE
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...