478 search results - page 36 / 96 » A simple expected running time analysis for randomized |
CN
2010
13 years 5 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
COLT
2005
Springer
14 years 2 months ago
2005
Springer
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
P2P
2007
IEEE
14 years 2 months ago
2007
IEEE
Maintaining desired data availability while minimizing costs is the primary challenge in designing P2P storages. Data placement schemes and data availability calculation methods a...
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
—Verification is a major issue in circuit and system design. Formal methods like bounded model checking (BMC) can guarantee a high quality of the verification. There are severa...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...