1383 search results - page 215 / 277 » On the Complexity of the Interlace Polynomial |
113
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
131
click to vote
ICML
2009
IEEE
15 years 8 months ago
2009
IEEE
In real sequence labeling tasks, statistics of many higher order features are not sufficient due to the training data sparseness, very few of them are useful. We describe Sparse H...
110
click to vote
LATA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
118
click to vote
TACAS
2009
Springer
15 years 8 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 8 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...