1383 search results - page 180 / 277 » On the Complexity of the Interlace Polynomial |
152
click to vote
CPM
2000
Springer
15 years 10 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
140
click to vote
ISSS
1999
IEEE
15 years 10 months ago
1999
IEEE
Portable or embedded systems allow more and more complex applications like multimedia today. These applications and submicronic technologies have made the power consumption criter...
167
click to vote
ESA
1999
Springer
15 years 10 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
151
click to vote
ICIAP
1999
ACM
15 years 10 months ago
1999
ACM
In this paper, we applied local warping techniques to construct a frame work of image-based morphing for facial expressions animation with low complexity. From the experience we o...
156
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...