11231 search results - page 102 / 2247 » Digging for Data Structures |
109
click to vote
DEBU
2006
15 years 2 months ago
2006
The World Wide Web is witnessing an increase in the amount of structured content
102
Voted
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
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...
127
click to vote
BMCBI
2010
15 years 2 months ago
2010
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...
235
Voted
ICDE
2004
IEEE
16 years 4 months ago
2004
IEEE
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 ...
144
Voted
ESOP
2009
Springer
15 years 9 months ago
2009
Springer
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...