Sciweavers

4816 search results - page 606 / 964
» Performance analysis of the AntNet algorithm
Sort
View
ICALP
2010
Springer
15 years 8 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
DGO
2006
148views Education» more  DGO 2006»
15 years 8 months ago
Automatically labeling hierarchical clusters
Government agencies must often quickly organize and analyze large amounts of textual information, for example comments received as part of notice and comment rulemaking. Hierarchi...
Pucktada Treeratpituk, Jamie Callan
DAGSTUHL
2004
15 years 8 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
DAC
2003
ACM
16 years 7 months ago
Using estimates from behavioral synthesis tools in compiler-directed design space exploration
This paper considers the role of performance and area estimates from behavioral synthesis in design space exploration. We have developed a compilation system that automatically ma...
Byoungro So, Pedro C. Diniz, Mary W. Hall
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 7 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...