8413 search results - page 1184 / 1683 » Ordering Problem Subgoals |
283
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Consider a set of signals fs : {1, . . . , N} [0, . . . , M] appearing as a stream of tuples (i, fs(i)) in arbitrary order of i and s. We would like to devise one pass approximat...
305
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
271
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...
307
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Given a region qR and a future timestamp qT, a "range aggregate" query estimates the number of objects expected to appear in qR at time qT. Currently the only methods fo...
288
click to vote
ICDE
2004
IEEE
16 years 8 months ago
2004
IEEE
Terrain can be approximated by a triangular mesh consisting millions of 3D points. Multiresolution triangular mesh (MTM) structures are designed to support applications that use t...