Sciweavers

2477 search results - page 64 / 496
» Approximate extended formulations
Sort
View
ICIP
2006
IEEE
16 years 8 months ago
Multichannel Sampling of Parametric Signals with a Successive Approximation Property
Recently the sampling theory for certain parametric signals based on rate of innovation has been extended to all sampling kernels that satisfy the Strang-Fix conditions, thus incl...
Julius Kusuma, Vivek K. Goyal
STACS
2009
Springer
16 years 1 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
CDC
2008
IEEE
16 years 1 months ago
Equivalence between Approximate Dynamic Inversion and Proportional-Integral control
—Approximate Dynamic Inversion (ADI) has been established as a method to control minimum-phase, nonaffine-incontrol systems. Previous results have shown that for single-input no...
Justin Teo, Jonathan P. How
168
Voted
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
15 years 10 months ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre
197
Voted
COLT
2010
Springer
15 years 4 months ago
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
Adi Akavia