460 search results - page 75 / 92 » Bounding the locality of distributed routing algorithms |
MIDDLEWARE
2007
Springer
14 years 1 months ago
2007
Springer
Distributed computations, dealing with large amounts of data, are scheduled in Grid clusters today using either a task-centric mechanism, or a worker-centric mechanism. Because of ...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
JMLR
2010
13 years 2 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
IPM
2007
13 years 7 months ago
2007
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...