2924 search results - page 410 / 585 » Lower Bounds in Distributed Computing |
145
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the s...
158
click to vote
IMC
2010
ACM
15 years 2 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
143
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
166
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
156
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...