2084 search results - page 100 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
100
click to vote
ECCC
2010
15 years 2 months ago
2010
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...
106
Voted
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
132
Voted
MST
2010
15 years 29 days ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
116
Voted
ECCC
2007
15 years 2 months ago
2007
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice where a machine is only required to behave appropriately when g...
142
Voted
CORR
2012
Springer
13 years 10 months ago
2012
Springer
erate (Extended Abstract) Patrick Bindjeme1† and James Allen Fill1 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Bal...