1998 search results - page 317 / 400 » Complexity of the Cover Polynomial |
104
Voted
TACAS
2009
Springer
15 years 7 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
IROS
2009
IEEE
15 years 7 months ago
2009
IEEE
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
108
Voted
APPT
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance...
133
Voted
CPM
2009
Springer
15 years 7 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
111
Voted
CSR
2009
Springer
15 years 7 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...