Sciweavers

67 search results - page 6 / 14
» Efficient Learning Algorithms Yield Circuit Lower Bounds
Sort
View
DAC
2004
ACM
14 years 8 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
ICML
2010
IEEE
13 years 5 months ago
Implicit Online Learning
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
Brian Kulis, Peter L. Bartlett
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
14 years 4 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 7 months ago
Online trading algorithms and robust option pricing
In this work we show how to use efficient online trading algorithms to price the current value of financial instruments, such as an option. We derive both upper and lower bounds f...
Peter DeMarzo, Ilan Kremer, Yishay Mansour
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
12 years 7 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett