2084 search results - page 158 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
120
Voted
COCO
2010
Springer
15 years 9 months ago
2010
Springer
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
164
click to vote
CNIS
2006
15 years 6 months ago
2006
Multidimensional Packet Classification is one of the most critical functions for network security devices such as firewalls and intrusion detection systems. Due to the worst case ...
172
Voted
CORR
2011
Springer
15 years 1 days ago
2011
Springer
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
155
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
182
click to vote
PG
2007
IEEE
2007
IEEE
Statistical Hypothesis Testing for Assessing Monte Carlo Estimators: Applications to Image Synthesis
15 years 11 months ago
Image synthesis algorithms are commonly compared on the basis of running times and/or perceived quality of the generated images. In the case of Monte Carlo techniques, assessment ...