Sciweavers

329 search results - page 22 / 66
» New lower bounds for some spherical designs
Sort
View
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
16 years 3 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
207
Voted
COLT
1997
Springer
15 years 10 months ago
Algorithmic Stability and Sanity-Check Bounds for Leave-one-Out Cross-Validation
: In this paper we prove sanity-check bounds for the error of the leave-one-out cross-validation estimate of the generalization error: that is, bounds showing that the worst-case e...
Michael J. Kearns, Dana Ron
ICALP
2009
Springer
16 years 26 days ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
COMPGEOM
1992
ACM
15 years 10 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
16 years 25 days ago
Gate sizing for large cell-based designs
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
Stephan Held