Sciweavers

11211 search results - page 238 / 2243
» Rank-Sensitive Data Structures
Sort
View
PODC
2011
ACM
14 years 9 months ago
On the power of hardware transactional memory to simplify memory management
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev,...
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 9 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
RIAO
2000
15 years 7 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
PSYCHNOLOGY
2008
94views more  PSYCHNOLOGY 2008»
15 years 6 months ago
A Design Framework for Mapping Social Relationships
This paper describes a design framework for representing social-spatial data on maps and diagrams and then illustrates the design approaches for representing social data in two ap...
Alistair G. Sutcliffe
SWSTE
2005
IEEE
16 years 1 days 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