523 search results - page 86 / 105 » On the Signal Bounding Problem in Timing Analysis |
110
Voted
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
163
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
129
click to vote
FOCS
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
103
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
102
click to vote
SWAT
2004
Springer
15 years 6 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...