9842 search results - page 1836 / 1969 » Compositional timing analysis |
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...
114
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
91
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
224
click to vote
VLDB
2005
ACM
16 years 1 months ago
2005
ACM
XML database systems emerge as a result of the acceptance of the XML data model. Recent works have followed the promising approach of building XML database management systems on un...
213
Voted
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...