Sciweavers

34 search results - page 2 / 7
» When and Why Ruppert's Algorithm Works
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 6 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
ESEC
1999
Springer
13 years 9 months ago
Yesterday, My Program Worked. Today, It Does Not. Why?
Imagine some program and a number of changes. If none of these changes is applied (“yesterday”), the program works. If all changes are applied (“today”), the program does n...
Andreas Zeller
TSP
2010
12 years 12 months ago
A subband adaptive iterative shrinkage/thresholding algorithm
We investigate a subband adaptive version of the popular iterative shrinkage/thresholding algorithm that takes different update steps and thresholds for each subband. In particular...
Ilker Bayram, Ivan W. Selesnick
KDD
2004
ACM
170views Data Mining» more  KDD 2004»
14 years 5 months ago
Why collective inference improves relational classification
Procedures for collective inference make simultaneous statistical judgments about the same variables for a set of related data instances. For example, collective inference could b...
David Jensen, Jennifer Neville, Brian Gallagher
GCB
2010
Springer
182views Biometrics» more  GCB 2010»
13 years 3 months ago
Repeat-aware Comparative Genome Assembly
: The current high-throughput sequencing technologies produce gigabytes of data even when prokaryotic genomes are processed. In a subsequent assembly phase, the generated overlappi...
Peter Husemann, Jens Stoye