Sciweavers

3020 search results - page 34 / 604
» Optimal partition trees
Sort
View
151
Voted
SWAT
2010
Springer
270views Algorithms» more  SWAT 2010»
15 years 8 months ago
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search ...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
137
Voted
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
15 years 7 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
177
Voted
EGH
2011
Springer
14 years 3 months ago
Simpler and Faster HLBVH with Work Queues
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...
110
Voted
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
15 years 10 months ago
Incorporating partitioning and parallel plans into the SCOPE optimizer
— Massive data analysis on large clusters presents new opportunities and challenges for query optimization. Data partitioning is crucial to performance in this environment. Howev...
Jingren Zhou, Per-Åke Larson, Ronnie Chaiken
80
Voted
ICIP
1998
IEEE
16 years 5 months ago
Optimal Hierarchical Partitions for Fractal Image Compression
Dietmar Saupe, Matthias Ruhl, Raouf Hamzaoui, Luig...