Sciweavers

4536 search results - page 60 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
SPAA
2010
ACM
13 years 9 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
PODC
2010
ACM
14 years 26 days ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
ADBIS
2010
Springer
145views Database» more  ADBIS 2010»
13 years 10 months ago
On Support of Ordering in Multidimensional Data Structures
Multidimensional data structures are applied in many areas, e.g. in data mining, indexing multimedia data and text documents, and so on. There are some applications where the range...
Filip Krizka, Michal Krátký, Radim B...
SIGCSE
2004
ACM
110views Education» more  SIGCSE 2004»
14 years 2 months ago
An extensible framework for providing dynamic data structure visualizations in a lightweight IDE
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
T. Dean Hendrix, James H. Cross II, Larry A. Barow...
BMCBI
2010
176views more  BMCBI 2010»
13 years 6 months ago
Haplotype association analyses in resources of mixed structure using Monte Carlo testing
Background: Genomewide association studies have resulted in a great many genomic regions that are likely to harbor disease genes. Thorough interrogation of these specific regions ...
Ryan Abo, Jathine Wong, Alun Thomas, Nicola J. Cam...