Sciweavers

1469 search results - page 94 / 294
» Approximate polynomial decomposition
Sort
View
CONIELECOMP
2006
IEEE
15 years 4 months ago
Chaotic Time Series Approximation Using Iterative Wavelet-Networks
This paper presents a wavelet neural-network for learning and approximation of chaotic time series. Wavelet-networks are inspired by both feed-forward neural networks and the theo...
E. S. Garcia-Trevino, Vicente Alarcón Aquin...
CORR
2010
Springer
189views Education» more  CORR 2010»
14 years 8 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
15 years 4 months ago
On the Complexity of Reliable Root Approximation
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
Michael Kerber
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
15 years 4 months ago
Parallel Approximation of Non-interactive Zero-sum Quantum Games
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
Rahul Jain, John Watrous
ICFHR
2010
136views Biometrics» more  ICFHR 2010»
14 years 4 months ago
Digital Ink Compression via Functional Approximation
Representing digital ink traces as points in a function space has proven useful for online recognition. Ink trace coordinates or their integral invariants are written as parametri...
Vadim Mazalov, Stephen M. Watt