Sciweavers

79 search results - page 4 / 16
» Biased Skip Lists
Sort
View
COMPGEOM
2005
ACM
13 years 9 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
ASPDAC
2009
ACM
109views Hardware» more  ASPDAC 2009»
13 years 8 months ago
Soft lists: a native index structure for NOR-flash-based embedded devices
Efficient data indexing is significant to embedded devices, because both CPU cycles and energy are very precious resources. Soft lists, a new index structure for embedded devices w...
Li-Pin Chang, Chen-Hui Hsu
CIC
2003
140views Communications» more  CIC 2003»
13 years 8 months ago
Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-su...
BIBE
2007
IEEE
125views Bioinformatics» more  BIBE 2007»
14 years 1 months ago
Large-scale Discovery of Regulatory Motifs Involved in Alternative Splicing
Alternative splicing is a highly important process in many eukaryotic organisms, but surprisingly little is known about its regulation. Often, this process involves cis-regulatory ...
Sihui Zhao, Jihye Kim, Steffen Heber
ACNS
2005
Springer
138views Cryptology» more  ACNS 2005»
14 years 27 days ago
Indexing Information for Data Forensics
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
Michael T. Goodrich, Mikhail J. Atallah, Roberto T...