Sciweavers

1517 search results - page 216 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
ACSW
2006
15 years 5 months ago
Improving resource utilisation in market oriented grid management and scheduling
Service providers of the future could dynamically negotiate for, and create their infrastructure on Grid based utility computing and communication providers. Such commercialisatio...
Kris Bubendorfer
JMLR
2010
115views more  JMLR 2010»
15 years 2 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
PERCOM
2011
ACM
14 years 7 months ago
Privacy preservation schemes for querying wireless sensor networks
—In this work we study the problem of query privacy in large scale sensor networks. Motivated by a novel trust model in which clients query networks owned by trusted entities but...
Tassos Dimitriou, Ahmad Sabouri
106
Voted
IPPS
2008
IEEE
15 years 10 months ago
Massively parallel cosmological simulations with ChaNGa
Cosmological simulators are an important component in the study of the formation of galaxies and large scale structures, and can help answer many important questions about the uni...
Pritish Jetley, Filippo Gioachin, Celso L. Mendes,...
IPPS
2009
IEEE
15 years 10 months ago
Coupled placement in modern data centers
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba