7930 search results - page 43 / 1586 » Greedy in Approximation Algorithms |
184
click to vote
CORR
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
109
click to vote
DEDS
2010
15 years 2 months ago
2010
We study approaches that fit a linear combination of basis functions to the continuation value function of an optimal stopping problem and then employ a greedy policy based on the...
125
Voted
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
172
click to vote
PODS
2011
ACM
14 years 5 months ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
CIAC
2003
Springer
15 years 7 months ago
2003
Springer