Sciweavers

3049 search results - page 215 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
SIAMNUM
2010
120views more  SIAMNUM 2010»
15 years 1 months ago
Sparse Spectral Approximations of High-Dimensional Problems Based on Hyperbolic Cross
Hyperbolic cross approximations by some classical orthogonal polynomials/functions in both bounded and unbounded domains are considered in this paper. Optimal error estimates in pr...
Jie Shen, Li-lian Wang
ISLPED
1996
ACM
72views Hardware» more  ISLPED 1996»
15 years 10 months ago
Simultaneous buffer and wire sizing for performance and power optimization
In this paper, we study the simultaneous buffer and wire sizing (SBWS) problem for delay and power dissipation minimization. We prove the BS/WS relation for optimal SBWS solutions...
Jason Cong, Cheng-Kok Koh, Kwok-Shing Leung
JDA
2007
83views more  JDA 2007»
15 years 6 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
COLT
2004
Springer
15 years 10 months ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
NIPS
2003
15 years 7 months ago
Online Learning of Non-stationary Sequences
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
Claire Monteleoni, Tommi Jaakkola