Sciweavers

124 search results - page 2 / 25
» The Cell Probe Complexity of Succinct Data Structures
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 7 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
ISBI
2007
IEEE
13 years 11 months ago
Prospecting for Live Cell Bioimaging Probes with Cheminformatic Assisted Image Array (caia)
Cheminformatic Assisted Image Array (CAIA) is a data mining and visualization tool linking chemical structures to microscope images of cells incubated with prospective bioimaging ...
Maria M. Posada, Kerby Shedden, Young Tae Chang, Q...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 10 months 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
VLDB
2001
ACM
109views Database» more  VLDB 2001»
13 years 9 months ago
Mining Multi-Dimensional Constrained Gradients in Data Cubes
Constrained gradient analysis (similar to the “cubegrade” problem posed by Imielinski, et al. [9]) is to extract pairs of similar cell characteristics associated with big chan...
Guozhu Dong, Jiawei Han, Joyce M. W. Lam, Jian Pei...
ICALP
2010
Springer
13 years 9 months ago
Cell Probe Lower Bounds and Approximations for Range Mode
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
Mark Greve, Allan Grønlund Jørgensen...