706 search results - page 121 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
SAS
2010
Springer
13 years 7 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
ICDM
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper, we propose a novel technique for the efficient prediction of multiple continuous target variables from high-dimensional and heterogeneous data sets using a hierarch...
ACMSE
2004
ACM
14 years 2 months ago
2004
ACM
In this paper, we propose a routing protocol that is based on securing the routing information from unauthorized users. Even though routing protocols of this category are already ...
CIKM
2006
Springer
14 years 15 days ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Linear inverse problems are very common in signal and image processing. Many algorithms that aim at solving such problems include unknown parameters that need tuning. In this work...