706 search results - page 83 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
JVCA
2008
13 years 8 months ago
2008
We present an efficient multigrid algorithm that is adequate to solve a heavy linear system given in cloth simulation. Although multigrid has been successfully applied to the Pois...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
VLDB
2000
ACM
14 years 13 days ago
2000
ACM
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
TSP
2010
13 years 3 months ago
2010
We consider efficient methods for the recovery of block-sparse signals--i.e., sparse signals that have nonzero entries occurring in clusters--from an underdetermined system of line...