14518 search results - page 2576 / 2904 » Two Problems for Sophistication |
190
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
185
Voted
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
175
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
173
click to vote
COCOON
2010
Springer
15 years 11 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
203
click to vote
EDCC
2010
Springer
15 years 11 months ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...