Sciweavers

5580 search results - page 385 / 1116
» Randomized priority algorithms
Sort
View
185
Voted
SAT
2005
Springer
124views Hardware» more  SAT 2005»
16 years 26 days ago
An Improved Upper Bound for SAT
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
Evgeny Dantsin, Alexander Wolpert
188
Voted
CTRSA
2005
Springer
210views Cryptology» more  CTRSA 2005»
16 years 26 days ago
Hold Your Sessions: An Attack on Java Session-Id Generation
HTTP session-id’s take an important role in almost any web site today. This paper presents a cryptanalysis of Java Servlet 128-bit session-id’s and an efficient practical predi...
Zvi Gutterman, Dahlia Malkhi
204
Voted
COCOON
2001
Springer
15 years 12 months ago
Packing Two Disks into a Polygonal Environment
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
Prosenjit Bose, Pat Morin, Antoine Vigneron
SPAA
1992
ACM
15 years 11 months ago
Matching the Bisection Bound for Routing and Sorting on the Mesh
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. ...
216
Voted
CISS
2007
IEEE
15 years 9 months ago
Consensus Estimation via Belief Propagation
Abstract –In this paper, a new problem, consensus estimation, is formulated, whose setting is complementary to the well-known CEO problem. In particular, a set of nodes are emplo...
Huaiyu Dai, Yanbing Zhang