Sciweavers

3475 search results - page 69 / 695
» Backbones in Optimization and Approximation
Sort
View
JSC
2008
162views more  JSC 2008»
15 years 2 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
SIAMNUM
2010
120views more  SIAMNUM 2010»
14 years 9 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
TEC
2008
115views more  TEC 2008»
15 years 2 months ago
Function Approximation With XCS: Hyperellipsoidal Conditions, Recursive Least Squares, and Compaction
An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen app...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
15 years 10 days ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
155
Voted
FOCS
2005
IEEE
15 years 8 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy