Sciweavers

124 search results - page 7 / 25
» The Cell Probe Complexity of Succinct Data Structures
Sort
View
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 10 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
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
14 years 1 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor
ICASSP
2009
IEEE
14 years 2 months ago
Identification of neurons participating in cell assemblies
Chances to detect assembly activity are expected to increase if the spiking activities of large numbers of neurons are recorded simultaneously. Although such massively parallel re...
Sonja Grün, Denise Berger, Christian Borgelt
CSR
2007
Springer
14 years 1 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
BMCBI
2008
124views more  BMCBI 2008»
13 years 7 months ago
RPPAML/RIMS: A metadata format and an information management system for reverse phase protein arrays
Background: Reverse Phase Protein Arrays (RPPA) are convenient assay platforms to investigate the presence of biomarkers in tissue lysates. As with other high-throughput technolog...
Romesh Stanislaus, Mark Carey, Helena F. Deus, Kev...