Sciweavers

11211 search results - page 139 / 2243
» Rank-Sensitive Data Structures
Sort
View
ICALP
2010
Springer
15 years 5 months ago
New Data Structures for Subgraph Connectivity
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
Ran Duan
109
Voted
BMCBI
2010
132views more  BMCBI 2010»
15 years 29 days ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
16 years 2 months ago
Algebraic Signatures for Scalable Distributed Data Structures
Signatures detect changes to the data objects. Numerous schemes a known, e.g., the popular hash based SHA-1 standard. We propose a nov scheme we call algebraic signatures. We use ...
Witold Litwin, Thomas J. E. Schwarz
131
Voted
ESOP
2009
Springer
15 years 7 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
KES
2007
Springer
15 years 7 months ago
Models for Identifying Structures in the Data: A Performance Comparison
This paper reports on the unsupervised analysis of seismic signals recorded in Italy, respectively on the Vesuvius volcano, located in Naples, and on the Stromboli volcano, located...
Anna Esposito, Antonietta M. Esposito, Flora Giudi...