Sciweavers

6110 search results - page 100 / 1222
» Approximate Computing
Sort
View
MOC
2010
15 years 1 months ago
Discontinuous Galerkin approximations of the Stokes and Navier-Stokes equations
Numerical schemes to compute approximate solutions of the evolutionary Stokes and Navier-Stokes equations are studied. The schemes are discontinuous in time and conforming in space...
Konstantinos Chrysafinos, Noel Walkington
ICDT
2011
ACM
232views Database» more  ICDT 2011»
14 years 9 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
15 years 7 months ago
Approximating the Visible Region of a Point on a Terrain
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
ICIP
2007
IEEE
16 years 8 months ago
Statistically Driven Sparse Image Approximation
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
Rosa M. Figueras i Ventura, Eero P. Simoncelli
DMSN
2004
ACM
15 years 11 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine