1383 search results - page 176 / 277 » On the Complexity of the Interlace Polynomial |
172
click to vote
ICML
2004
IEEE
15 years 12 months ago
2004
IEEE
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
168
click to vote
CIS
2004
Springer
15 years 11 months ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
143
click to vote
CONCUR
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
138
click to vote
CPAIOR
2004
Springer
15 years 11 months ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
164
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...