Sciweavers

3608 search results - page 149 / 722
» computer 2011
Sort
View
129
Voted
ICASSP
2011
IEEE
14 years 7 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
150
Voted
ECCC
2011
234views ECommerce» more  ECCC 2011»
14 years 10 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan
133
Voted
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 10 months ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker
223
Voted
ASPLOS
2011
ACM
14 years 7 months ago
Dynamic knobs for responsive power-aware computing
We present PowerDial, a system for dynamically adapting application behavior to execute successfully in the face of load and power fluctuations. PowerDial transforms static con...
Henry Hoffmann, Stelios Sidiroglou, Michael Carbin...
138
Voted
CCS
2011
ACM
14 years 3 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum