2228 search results - page 32 / 446 » Distributed Data Clustering Can Be Efficient and Exact |
SIAMCOMP
2010
13 years 2 months ago
2010
We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
The emerging edge services architecture promises to improve the availability and performance of web services by replicating servers at geographically distributed sites. A key chal...
NIPS
2008
13 years 9 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
EUROPAR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Modern microprocessors have sacrificed the exactness of exceptions for improved performance long ago. This is a side effect of reordering instructions so that the micropr...
UAI
2008
13 years 9 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...