5153 search results - page 512 / 1031 » Introduction to Randomized Algorithms |
223
click to vote
ALT
2011
Springer
14 years 6 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
201
Voted
IACR
2011
14 years 6 months ago
2011
The KeeLoq cipher is used in many wireless car door systems and garage openers. Recently the algorithm was studied and several attacks have been published. When a random seed is no...
190
click to vote
PRICAI
2004
Springer
16 years 10 hour ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
173
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
199
click to vote
JSAC
2008
15 years 6 months ago
2008
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...