Sciweavers

943 search results - page 16 / 189
» How should data structures and algorithms be taught
Sort
View
PODS
2006
ACM
122views Database» more  PODS 2006»
15 years 9 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
CACM
2008
101views more  CACM 2008»
14 years 9 months ago
Just say 'A Class Defines a Data Type'
data type and (Java) class, asking about the relationship between them. The same students would also be unlikely to find an answer in a CS1 textbook. Some textbooks might not even ...
Chenglie Hu
BMCBI
2008
141views more  BMCBI 2008»
14 years 9 months ago
Ontology-guided data preparation for discovering genotype-phenotype relationships
Complexity of post-genomic data and multiplicity of mining strategies are two limits to Knowledge Discovery in Databases (KDD) in life sciences. Because they provide a semantic fr...
Adrien Coulet, Malika Smaïl-Tabbone, Pascale ...
FMSD
2002
114views more  FMSD 2002»
14 years 9 months ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
Ruben Gamboa
108
Voted
PODC
2010
ACM
15 years 1 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer