Sciweavers

5169 search results - page 172 / 1034
» Locality approximation using time
Sort
View
131
Voted
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
15 years 10 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
DISOPT
2010
132views more  DISOPT 2010»
15 years 5 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
PE
2006
Springer
125views Optimization» more  PE 2006»
15 years 5 months ago
Approximating multi-skill blocking systems by HyperExponential Decomposition
We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The...
Geert Jan Franx, Ger Koole, Auke Pot
157
Voted
DSP
2006
15 years 5 months ago
On the application of cross correlation function to subsample discrete time delay estimation
Cross correlation function (CCF) of signals is an important tool of multi-sensors signal processing. Parabola functions are commonly used as parametric models of the CCF in time d...
Lei Zhang 0006, Xiaolin Wu
145
Voted
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 9 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates