Sciweavers

631 search results - page 36 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
WEA
2005
Springer
100views Algorithms» more  WEA 2005»
14 years 3 months ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev
IJCV
2012
12 years 16 days ago
Sparse Occlusion Detection with Optical Flow
Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a vari...
Alper Ayvaci, Michalis Raptis, Stefano Soatto
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
14 years 11 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
ICML
2001
IEEE
14 years 11 months ago
Off-Policy Temporal Difference Learning with Function Approximation
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
Doina Precup, Richard S. Sutton, Sanjoy Dasgupta
PODS
1999
ACM
151views Database» more  PODS 1999»
14 years 2 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin