Sciweavers

1469 search results - page 114 / 294
» Approximate polynomial decomposition
Sort
View
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 1 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
AUTOMATICA
2006
106views more  AUTOMATICA 2006»
14 years 10 months ago
Barrier certificates for nonlinear model validation
Abstract-- New methods for model validation of continuoustime nonlinear systems with uncertain parameters are presented in this paper. The methods employ functions of state-paramet...
Stephen Prajna
WWW
2005
ACM
15 years 10 months ago
On the feasibility of low-rank approximation for personalized PageRank
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...
András A. Benczúr, Károly Csa...
DAGSTUHL
2010
14 years 11 months ago
On Curved Simplicial Elements and Best Quadratic Spline Approximation for Hierarchical Data Representation
We present a method for hierarchical data approximation using curved quadratic simplicial elements for domain decomposition. Scientific data defined over two- or three-dimensional ...
Bernd Hamann
TSP
2008
178views more  TSP 2008»
14 years 9 months ago
Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
Pei Chen