706 search results - page 99 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
SOFSEM
2000
Springer
14 years 12 days ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
PODS
2008
ACM
14 years 9 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
MOBIHOC
2005
ACM
14 years 8 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
COMPGEOM
2006
ACM
14 years 17 days ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
TIP
2010
13 years 3 months ago
2010
Nonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficu...