1074 search results - page 21 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
DC
1998
14 years 9 months ago
1998
We show that the problem of predicate detection in distributed systems is NP-complete. In the past, efficient algorithms have been developed for special classes of predicates suc...
EACL
2003
ACL Anthology
14 years 11 months ago
2003
ACL Anthology
In this paper we discuss algorithms for clustering words into classes from unlabelled text using unsupervised algorithms, based on distributional and morphological information. We...
80
Voted
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
ICDCN
2009
Springer
15 years 4 months ago
2009
Springer
Chandy et al. proposed the methodology of “self-similar algorithms” for distributed computation in dynamic environments. We further characterize the class of functions computab...