12519 search results - page 286 / 2504 » Approximation Problems Categories |
187
click to vote
COCOON
2005
Springer
16 years 24 days ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
202
click to vote
ICML
2003
IEEE
16 years 8 months ago
2003
IEEE
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
181
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
212
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
182
click to vote
IWANN
2005
Springer
16 years 23 days ago
2005
Springer
Abstract. This paper presents k-NN as an approximator for time series prediction problems. The main advantage of this approximator is its simplicity. Despite the simplicity, k-NN c...