196 search results - page 6 / 40 » PASS Approximation |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
This paper surveys recent work in applying ideas from graphical models and message passing algorithms to solve large scale regularized regression problems. In particular, the focu...
CGF
2008
13 years 7 months ago
2008
We present a method for rendering approximate soft shadows and diffuse indirect illumination in dynamic scenes. The proposed method approximates the original scene geometry with a...
TOG
2002
13 years 7 months ago
2002
This paper introduces an efficient two-pass rendering technique for translucent materials. We decouple the computation of irradiance at the surface from the evaluation of scatteri...
FOCS
2007
IEEE
14 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...