7006 search results - page 231 / 1402 » Approximation Algorithms |
JDA
2006
15 years 3 months ago
2006
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
130
Voted
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we extend the cross-multiplicative transfer function (CMTF) approach for improved system identification in the shorttime Fourier transform (STFT) domain. The propo...
112
Voted
SYNASC
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract. In this paper we give some applications of weakly Picard operators theory to linear positive approximation operators, to difference equations with deviating argument and...
158
Voted
SODA
1992
ACM
15 years 4 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
128
click to vote
PODS
2004
ACM
16 years 3 months ago
2004
ACM
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...