Sciweavers

11231 search results - page 184 / 2247
» Digging for Data Structures
Sort
View
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
15 years 21 days ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
Francois Carouge, Michael F. Spear
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 5 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
119
Voted
RIAO
2000
15 years 4 months ago
Multimedia structuring using trees
Traditionally work on multimedia structuring has been centered on the creation of indices and their use for searching. Although searching is important there are many cases where t...
George Tzanetakis, Luc Julia
SWSTE
2005
IEEE
15 years 8 months ago
Mapping Structures for Flash Memories: Techniques and Open Problems
Flash memory is a type of electrically erasable programmable read-only memory (EEPROM). Because flash memories are nonvolatile and relatively dense, they are now used to store ï¬...
Eran Gal, Sivan Toledo
BIBE
2004
IEEE
149views Bioinformatics» more  BIBE 2004»
15 years 6 months ago
Interactive 3D Protein Structure Visualization Using Virtual Reality
Large-scale biomedical data sets of macromolecular structures such as DNA and proteins describe highly complex biomolecular entities which often consist of thousands of atoms and ...
Elke Moritz, Jörg Meyer