7006 search results - page 268 / 1402 » Approximation Algorithms |
215
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
158
click to vote
CONIELECOMP
2006
IEEE
16 years 14 days ago
2006
IEEE
This paper presents a wavelet neural-network for learning and approximation of chaotic time series. Wavelet-networks are inspired by both feed-forward neural networks and the theo...
180
click to vote
CPM
1998
Springer
15 years 10 months ago
1998
Springer
While much work has been done on determining if a document or a line of a document contains an exact or approximate match to a regular expression, less e ort has been expended in ...
172
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
187
click to vote
COLOGNETWENTE
2007
15 years 7 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...