Sciweavers

Share
CSR
2010
Springer
9 years 10 months ago
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
Pawel Gawrychowski, Artur Jez, Lukasz Jez
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
10 years 5 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
KDD
2003
ACM
160views Data Mining» more  KDD 2003»
10 years 5 months ago
Playing hide-and-seek with correlations
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
Chris Jermaine
books