1688 search results - page 142 / 338 » The Complexity of Rationalizing Matchings |
207
click to vote
CONCUR
1998
Springer
15 years 10 months ago
1998
Springer
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
176
click to vote
BMCBI
2004
15 years 5 months ago
2004
Background: Recent technological advances in high-throughput data collection allow for experimental study of increasingly complex systems on the scale of the whole cellular genome...
199
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
179
click to vote
ICARCV
2002
IEEE
15 years 10 months ago
2002
IEEE
With the advances in digital imagery, large accessible data storage, internet repositories, and image applications, information conveyed through images is gaining in importance. T...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...