934 search results - page 166 / 187 » A theoretical analysis of the HIFF problem |
102
click to vote
GI
1998
Springer
15 years 1 months ago
1998
Springer
"KnowledgeMiner" was designed to support the knowledge extraction process on a highly automated level. Implemented are 3 different GMDH-type self-organizing modeling algo...
FOCS
1994
IEEE
15 years 1 months ago
1994
IEEE
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
111
Voted
STACS
1992
Springer
15 years 1 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
105
click to vote
BALT
2006
15 years 1 months ago
2006
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...