282 search results - page 30 / 57 » Efficient bundle sorting |
POPL
2003
ACM
14 years 7 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
BTW
2003
Springer
14 years 17 days ago
2003
Springer
Abstract: Optimization of nested queries, in particular finding equivalent “flattened” queries for queries that employ the SQL sub-query construct, has been researched extensiv...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...