Sciweavers

2498 search results - page 241 / 500
» Data Structures with Unpredictable Timing
Sort
View
BILDMED
2007
148views Algorithms» more  BILDMED 2007»
15 years 4 months ago
Bayesian Vessel Extraction for Planning of Radiofrequency-Ablation
The software-assisted planning of radiofrequency-ablation of liver tumors calls for robust and fast methods to segment the tumor and surrounding vascular structures from clinical d...
Stephan Zidowitz, Johann Drexl, Tim Kröger, T...
96
Voted
HPCA
2008
IEEE
16 years 2 months ago
Address-branch correlation: A novel locality for long-latency hard-to-predict branches
Hard-to-predict branches depending on longlatency cache-misses have been recognized as a major performance obstacle for modern microprocessors. With the widening speed gap between...
Hongliang Gao, Yi Ma, Martin Dimitrov, Huiyang Zho...
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
16 years 2 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
194
Voted
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
16 years 2 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
107
Voted
SPAA
2005
ACM
15 years 8 months ago
Using elimination to implement scalable and lock-free FIFO queues
This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specific...
Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit