4843 search results - page 182 / 969 » The Shortcut Problem - Complexity and Approximation |
132
click to vote
ICML
2003
IEEE
16 years 4 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...
128
Voted
ICALP
2009
Springer
15 years 10 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...
142
click to vote
FOCS
2007
IEEE
15 years 9 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...
113
click to vote
IWANN
2005
Springer
15 years 8 months 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...
107
click to vote
IJIT
2004
15 years 4 months ago
2004
Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of ...