Sciweavers

3341 search results - page 480 / 669
» On Bounded Queries and Approximation
Sort
View
ICML
2009
IEEE
16 years 1 months ago
Online learning by ellipsoid method
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
Liu Yang, Rong Jin, Jieping Ye
ICASSP
2009
IEEE
16 years 1 months ago
Particle filtering for Quantized Innovations
In this paper, we re-examine the recently proposed distributed state estimators based on quantized innovations. It is widely believed that the error covariance of the Quantized In...
Ravi Teja Sukhavasi, Babak Hassibi
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
16 years 1 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
ISSAC
2009
Springer
121views Mathematics» more  ISSAC 2009»
16 years 1 months ago
Faster real feasibility via circuit discriminants
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ï¬...
Frédéric Bihan, J. Maurice Rojas, Ca...
ASPDAC
2009
ACM
142views Hardware» more  ASPDAC 2009»
16 years 1 months ago
On the futility of statistical power optimization
In response to the increasing variations in integrated-circuit manufacturing, the current trend is to create designs that take these variations into account statistically. In this...
Jason Cong, Puneet Gupta, John Lee