18 search results - page 2 / 4 » jacm 2010 |
JACM
2010
13 years 4 days ago
2010
JACM
2010
13 years 3 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
JACM
2010
13 years 3 months ago
2010
This article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure...
JACM
2010
13 years 3 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
JACM
2010
13 years 3 months ago
2010
clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...