15485 search results - page 289 / 3097 » Computing Optimal Subsets |
142
click to vote
ENDM
2008
15 years 6 months ago
2008
This paper shows that a well-known algorithm proposed to compute the canonical polygonal schema of a surface can be transferred onto a 2-dimensional generalized map. We show that ...
180
click to vote
MOC
2000
15 years 6 months ago
2000
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
277
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
186
click to vote
CJ
1999
15 years 6 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
272
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...