2430 search results - page 238 / 486 » Computing Tutte Polynomials |
133
click to vote
COLING
2000
15 years 5 months ago
2000
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between ...
128
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
148
click to vote
SODA
1992
ACM
15 years 5 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
116
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
136
click to vote
AAECC
2007
Springer
15 years 4 months ago
2007
Springer
We discuss parametrizations of filter coefficients of scaling functions and compactly supported orthonormal wavelets with several vanishing moments. We introduce the first discr...