19866 search results - page 18 / 3974 » Computing all factorizations in *** |
ALGORITHMICA
2006
14 years 9 months ago
2006
: We study the output-sensitive computations of all the combinations of the edges and vertices of a simple polygon P that allow a form closure grasp with less than four point conta...
104
click to vote
CPM
1994
Springer
15 years 1 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
ACL
2008
14 years 11 months ago
2008
Computing confidence scores for applications, such as dialogue system, information retrieving and extraction, is an active research area. However, its focus has been primarily on ...
64
Voted
EUROPAR
2007
Springer
15 years 1 months ago
2007
Springer
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of Tarasov and Vyaly...