2084 search results - page 126 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
128
Voted
JMLR
2006
15 years 4 months ago
2006
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
169
click to vote
SODA
2010
ACM
15 years 3 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
142
click to vote
JCO
2010
15 years 3 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
107
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...
254
click to vote
POPL
2005
ACM
16 years 5 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...