706 search results - page 35 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
RECOMB
2003
Springer
14 years 8 months ago
2003
Springer
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
APPROX
2010
Springer
13 years 7 months ago
2010
Springer
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
Motivated by a probe-vehicle based automotive traffic monitoring system, this paper considers the problem of guaranteed anonymity in a dataset of location traces while maintainin...
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
ECCC
2010
13 years 5 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...