Sciweavers

4536 search results - page 12 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
BMCBI
2010
132views more  BMCBI 2010»
13 years 7 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
DCC
2007
IEEE
14 years 7 months ago
Algorithms and Hardware Structures for Unobtrusive Real-Time Compression of Instruction and Data Address Traces
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software de...
Milena Milenkovic, Aleksandar Milenkovic, Martin B...
COMPGEOM
2004
ACM
14 years 1 months ago
Towards in-place geometric algorithms and data structures
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
Hervé Brönnimann, Timothy M. Chan, Eri...
PARA
2004
Springer
14 years 29 days ago
A Cache-Aware Algorithm for PDEs on Hierarchical Data Structures
A big challenge in implementing up to date simulation software for various applications is to bring together highly efficient mathematical methods on the one hand side and an ef...
Frank Günther, Miriam Mehl, Markus Pögl,...
FIMI
2004
175views Data Mining» more  FIMI 2004»
13 years 9 months ago
CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
Yudho Giri Sucahyo, Raj P. Gopalan