10633 search results - page 1734 / 2127 » Relating Distributed Objects |
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
136
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
160
Voted
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Web users display their preferences implicitly by navigating through a sequence of pages or by providing numeric ratings to some items. Web usage mining techniques are used to ext...
130
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
202
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...