1092 search results - page 141 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
139
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...
135
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
155
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
Maximum Likelihood estimation theory can be used to develop optimal timing recovery schemes for digital communication systems. Tunable digital interpolation filters are commonly ...
135
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
203
click to vote
RANDOM
2001
Springer
15 years 10 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...