2514 search results - page 361 / 503 » On the Computation of Approximations of Database Queries |
228
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with c...
180
Voted
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
207
Voted
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
175
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
204
Voted
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...