Furst, Merrick Lee 1955-
Most widely held works by Merrick Lee Furst
Learning AC⁰ functions sampled under mutually independent distributions by Merrick Lee Furst ( Book )
1 edition published in 1990 in English and held by 6 WorldCat member libraries worldwide
To prove the time bound on our algorithm we show that a modified version of the Main Lemma of Linial et al. holds for Fourier coefficients defined relative to any basis which is orthonormal with respect to some mutually independent distribution. The proof of the modified lemma requires a generalization of Hastad's Switching Lemma which may also be of general interest."
On the diameter of permutation groups by James Richard Driscoll ( Book )
1 edition published in 1983 in English and held by 5 WorldCat member libraries worldwide
A subexponential algorithm for trivalent graph isomorphism by Merrick Lee Furst ( Book )
3 editions published in 1980 in English and held by 5 WorldCat member libraries worldwide
NO ABSTRACT SUPPLIED
Fast planning through planning graph analysis by Avrim Blum ( Book )
1 edition published in 1995 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest-possible partial-order plan, or states that no valid plan exists. We provide empirical evidence in favor of this approach, showing that Graphplan outperforms the total-order planner, Prodigy, and the partial-order planner, UCPOP, on a variety of interesting natural and artificial planning problems. We also give empirical evidence that the plans produced by Graphplan are quite sensible. Since searches made by this approach are fundamentally different from the searches of other common planning methods, they provide a new perspective on the planning problem."
Exploiting correlations among models with application to large vocabulary speech recognition by Ronald Rosenfeld ( Book )
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
One of the most useful applications of these distributions is as a basis for a new Bayesian classifier. The latter can be used to significantly reduce search effort in large vocabularies, and to quickly obtain a short list of candidate words. An example HMM-based system shows promising results."
Polynomial-time algorithms for permutation groups by Merrick Lee Furst ( Book )
1 edition published in 1980 in English and held by 3 WorldCat member libraries worldwide
A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time. In addition, we demonstrate that the normal closure of a subgroup can be computed in polynomial time, and that this procedure can be used to test a group for solvability. We also describe an approach to computing the intersection of two groups. The procedures and techiques have wide applicability and have recently been used to improve many graph isomorphism algorithms. (Author)
A linear time algorithm for the generalized consecutive retrieval problem by Paul Frederick Dietz ( Book )
1 edition published in 1979 in English and held by 1 WorldCat member library worldwide
PSPACE survives three-bit bottlenecks by Jin-yi Cai ( Book )
1 edition published in 1987 in English and held by 1 WorldCat member library worldwide