144 search results - page 22 / 29 » Improved Approximation Guarantees for Sublinear-Time Fourier... |
225
Voted
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
136
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
168
Voted
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
120
Voted
ICCAD
2001
IEEE
16 years 17 days ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
150
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...