Sciweavers

1672 search results - page 259 / 335
» Tightness problems in the plane
Sort
View
ECCTD
2011
63views more  ECCTD 2011»
12 years 9 months ago
Ladder-Biquad filter partitioning for on-chip tuning
— One of the problems with on-chip active-RC filters is that in order to satisfy tight specifications accurately, they need to be fine-tuned. This becomes more difficult with inc...
Drazen Jurisic, George S. Moschytz
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
12 years 3 days ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko
INFOCOM
2009
IEEE
14 years 4 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 10 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 4 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti