457 search results - page 47 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
141
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
162
click to vote
FOCS
2008
IEEE
16 years 17 days ago
2008
IEEE
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
142
click to vote
MMS
1998
15 years 5 months ago
1998
In packet audio applications, packets are buffered at a receiving site and their playout delayed in order to compensate for variable network delays. In this paper, we consider the ...
168
click to vote
CONCUR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
153
click to vote
GD
2003
Springer
15 years 11 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...