10901 search results - page 2105 / 2181 » Approximations in Distributed Optimization |
128
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
135
click to vote
OSDI
2004
ACM
16 years 3 months ago
2004
ACM
Detecting network path anomalies generally requires examining large volumes of traffic data to find misbehavior. We observe that wide-area services, such as peerto-peer systems an...
133
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
213
click to vote
VLDB
2004
ACM
16 years 3 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
239
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...