WorldCat Identities

Furst, Merrick Lee 1955-

Overview
Works: 9 works in 12 publications in 1 language and 31 library holdings
Roles: Author
Classifications: QA76.C37X NO. 90-183, 510.7808
Publication Timeline
.
Most widely held works by Merrick Lee Furst
A subexponential algorithm for trivalent graph isomorphism by Merrick Lee Furst( Book )
4 editions published in 1980 in English and held by 6 WorldCat member libraries worldwide
NO ABSTRACT SUPPLIED
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
Abstract: "AC⁰ is a large class of functions including such fundamental ones as addition. An algorithm of Linial, Mansour, and Nisan learns any AC⁰ function in at most quasi-polynomial (n[superscript poly log n]) time if examples are drawn uniformly. We extend their algorithm to learn any AC⁰ function, still in quasi-polynomial time, when examples are drawn according to any mutually independent distribution. The distribution itself does not need to be specified in advance but is also learned by the algorithm. We further indicate how the algorithm might be extended for learning AC⁰ functions sampled under arbitrary distributions
Fast planning through planning graph analysis by A. L 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
Abstract: "In a typical speech recognition system, computing the match between an incoming acoustic string and many competing models is computationally expensive. Once the highest ranking models are identified, all other match scores are discarded. We propose to make use of all computed scores by means of statistical inference. We view the match between an incoming acoustic string s and a model M[subscript i] as a random variable Y[subscript i]. The class-conditional distributions of (Y₁ ..., Y[subscript N]) can be studied offline by sampling, and then used in a variety of ways. For example, the means of these distributions give rise to a natural measure of distance between models
On the diameter of permutation groups by J. R Driscoll( Book )
1 edition published in 1983 in English and held by 4 WorldCat member libraries worldwide
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 techniques have wide applicability and have recently been used to improve many graph isomorphism algorithms
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
Lie algebra cohomology by Merrick Lee Furst( )
1 edition published in 1976 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
 
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.71 (from 0.47 for On the dia ... to 0.89 for Learning A ...)
Languages
English (12)