1369 search results - page 259 / 274 » Lattice computations for random numbers |
PODC
2010
ACM
14 years 21 days ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
COLT
2006
Springer
14 years 16 days ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
DCOSS
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. We present a comparative mathematical analysis of two important distinct approaches to hybrid push-pull querying in wireless sensor networks: structured hash-based data-c...
FOCS
1995
IEEE
14 years 10 days ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
NSDI
2008
13 years 11 months ago
2008
Large-scale distributed denial of service (DoS) attacks are an unfortunate everyday reality on the Internet. They are simple to execute and with the growing prevalence and size of...