Sciweavers

11016 search results - page 2113 / 2204
» Cloud Computing for Science
Sort
View
144
Voted
VLSID
2007
IEEE
210views VLSI» more  VLSID 2007»
16 years 3 months ago
Dynamically Optimizing FPGA Applications by Monitoring Temperature and Workloads
In the past, Field Programmable Gate Array (FPGA) circuits only contained a limited amount of logic and operated at a low frequency. Few applications running on FPGAs consumed exc...
Phillip H. Jones, Young H. Cho, John W. Lockwood
121
Voted
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
16 years 2 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
138
Voted
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 2 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
ICALP
2009
Springer
16 years 2 months ago
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called I...
Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Isaac Ka...
ICALP
2009
Springer
16 years 2 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
« Prev « First page 2113 / 2204 Last » Next »