Sciweavers

1147 search results - page 69 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
FOCS
2006
IEEE
14 years 3 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 3 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
ICALP
1994
Springer
14 years 1 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias
TCOM
2010
68views more  TCOM 2010»
13 years 7 months ago
Convergence Analysis of Downstream VDSL Adaptive Multichannel Partial FEXT Cancellation
—In this paper we analyze an adaptive downstream multichannel VDSL precoder that is based on error signal feedback. The analysis presents sufficient conditions for precoder conv...
Itsik Bergel, Amir Leshem
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 10 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe