2084 search results - page 89 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
149
Voted
ECRTS
2007
IEEE
15 years 8 months ago
2007
IEEE
Feedback control techniques have recently been applied to a variety of real-time systems. However, a fundamental issue that was left out is guaranteeing system controllability and...
130
click to vote
ECCC
2010
15 years 2 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
151
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
109
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
121
Voted
TIT
2010
14 years 9 months ago
2010
This is the first part of a two-part paper on information-theoretically secure secret key agreement. In this part, we study the secrecy problem under the widely studied source mod...