2084 search results - page 292 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ICML
1996
IEEE
15 years 10 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
111
click to vote
CDC
2008
IEEE
14 years 10 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
ICDCS
1995
IEEE
15 years 1 months ago
1995
IEEE
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
104
click to vote
ANCS
2008
ACM
14 years 12 months ago
2008
ACM
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...