Sciweavers

766 search results - page 79 / 154
» Online Variance Minimization
Sort
View
NIPS
2004
15 years 1 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg
SIGMOD
2010
ACM
204views Database» more  SIGMOD 2010»
15 years 2 days ago
Positional update handling in column stores
In this paper we investigate techniques that allow for on-line updates to columnar databases, leaving intact their high read-only performance. Rather than keeping differential str...
Sándor Héman, Marcin Zukowski, Niels...
ICCAD
2009
IEEE
101views Hardware» more  ICCAD 2009»
14 years 9 months ago
Compacting test vector sets via strategic use of implications
As the complexity of integrated circuits has increased, so has the need for improving testing efficiency. Unfortunately, the types of defects are also becoming more complex, which...
Nuno Alves, Jennifer Dworak, R. Iris Bahar, Kundan...
ICASSP
2011
IEEE
14 years 3 months ago
Reinforcement learning for energy-efficient wireless transmission
We consider the problem of energy-efficient point-to-point transmission of delay-sensitive data (e.g. multimedia data) over a fading channel. We propose a rigorous and unified fra...
Nicholas Mastronarde, Mihaela van der Schaar
DAC
2006
ACM
16 years 26 days ago
An adaptive FPGA architecture with process variation compensation and reduced leakage
Process induced threshold voltage variations bring about fluctuations in circuit delay, that affect the FPGA timing yield. We propose an adaptive FPGA architecture that compensate...
Georges Nabaa, Navid Azizi, Farid N. Najm