523 search results - page 40 / 105 » On the Signal Bounding Problem in Timing Analysis |
CGF
2000
15 years 1 months ago
2000
espace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified...
112
click to vote
CONCUR
2000
Springer
15 years 5 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
121
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
121
click to vote
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
141
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...