Sciweavers

3122 search results - page 624 / 625
» Storing Semistructured Data with STORED
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
COMPGEOM
2010
ACM
14 years 16 days ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
NAR
1998
94views more  NAR 1998»
13 years 7 months ago
HuGeMap: a distributed and integrated Human Genome Map database
The HuGeMap database stores the major genetic and physical maps of the human genome. It is also interconnected with the gene radiation hybrid mapping database RHdb. HuGeMap is acc...
Emmanuel Barillot, Frédéric Guyon, C...
CHI
2009
ACM
14 years 8 months ago
Interacting with eHealth: towards grand challenges for HCI
While health records are increasingly stored electronically, we, as citizens, have little access to this data about ourselves. We are not used to thinking of these official record...
m. c. schraefel, Paul André, Ryen White, De...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 20 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen