7758 search results - page 308 / 1552 » On the Number of Distributive Lattices |
180
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
214
click to vote
FSTTCS
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
177
click to vote
CCGRID
2003
IEEE
15 years 12 months ago
2003
IEEE
— Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach...
196
click to vote
APSEC
2002
IEEE
15 years 11 months ago
2002
IEEE
We have taught several distributed software engineering project courses with students and real clients [4]. During these projects, students in Pittsburgh and Munich, Germany colla...
167
click to vote
JOIN
2007
15 years 6 months ago
2007
In this paper, we show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. W...