Sciweavers

4277 search results - page 150 / 856
» On Multiple Linear Approximations
Sort
View
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
15 years 10 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
CDC
2008
IEEE
15 years 5 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
ICASSP
2008
IEEE
15 years 5 months ago
Cepstral domain feature compensation based on diagonal approximation
In this paper, we propose a novel approach to feature compensation performed in the cepstral domain. We apply the linear approximation method in the cepstral domain to simplify th...
Woohyung Lim, Chang Woo Han, Jong Won Shin, Nam So...
STOC
1998
ACM
167views Algorithms» more  STOC 1998»
15 years 2 months ago
An Improved Approximation Algorithm for Multiway Cut
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
15 years 2 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