Results 1  10
of
1,080,909
Fast Learning of kTerm DNF Formulas with Queries
 In Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing
, 1992
"... This paper presents an algorithm that uses equivalence and membership queries to learn the class of kterm DNF formulas in time O(n \Delta k O(k) ), where n is the number of input variables. This algorithm allows one to learn DNF of O( log n log log n ) terms in polynomial time, and is the fi ..."
Abstract

Cited by 51 (2 self)
 Add to MetaCart
This paper presents an algorithm that uses equivalence and membership queries to learn the class of kterm DNF formulas in time O(n \Delta k O(k) ), where n is the number of input variables. This algorithm allows one to learn DNF of O( log n log log n ) terms in polynomial time
Learning kterm DNF Formulas with an Incomplete Membership Oracle
 In Proc. 5th Annu. Workshop on Comput. Learning Theory
, 1992
"... We consider the problem of learning kterm DNF formulas using equivalence queries and incomplete membership queries as defined by Angluin and Slonim. We demonstrate that this model can be applied to nonmonotone classes. Namely, we describe a polynomialtime algorithm that exactly identifies a k t ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We consider the problem of learning kterm DNF formulas using equivalence queries and incomplete membership queries as defined by Angluin and Slonim. We demonstrate that this model can be applied to nonmonotone classes. Namely, we describe a polynomialtime algorithm that exactly identifies a k
Psufficient statistics for PAC learning ktermDNF formulas through enumeration.
"... Working in the framework of PAClearning theory, we present special statistics for accomplishing in polynomial time proper learning of DNF boolean formulas having a fixed number of monomials. Our statistics turn out to be near sufficient for a large family of distribution lawsthat we call butter ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Working in the framework of PAClearning theory, we present special statistics for accomplishing in polynomial time proper learning of DNF boolean formulas having a fixed number of monomials. Our statistics turn out to be near sufficient for a large family of distribution lawsthat we call
An equilibrium characterization of the term structure.
 J. Financial Econometrics
, 1977
"... The paper derives a general form of the term structure of interest rates. The following assumptions are made: (A.l) The instantaneous (spot) interest rate follows a diffusion process; (A.2) the price of a discount bond depends only on the spot rate over its term; and (A.3) the market is efficient. ..."
Abstract

Cited by 1009 (0 self)
 Add to MetaCart
The paper derives a general form of the term structure of interest rates. The following assumptions are made: (A.l) The instantaneous (spot) interest rate follows a diffusion process; (A.2) the price of a discount bond depends only on the spot rate over its term; and (A.3) the market is efficient
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order differenti ..."
Abstract

Cited by 571 (6 self)
 Add to MetaCart
scheme. In chapter 3 we list the qanalogues of the polynomials in the Askeyscheme. We give their definition, orthogonality relation, three term recurrence relation, second order di#erence equation, forward and backward shift operator, Rodriguestype formula and generating functions. In chapter 4 we give the limit
The Encyclopedia of Integer Sequences
"... This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs ..."
Abstract

Cited by 857 (14 self)
 Add to MetaCart
This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae
Maximum Likelihood Linear Transformations for HMMBased Speech Recognition
 COMPUTER SPEECH AND LANGUAGE
, 1998
"... This paper examines the application of linear transformations for speaker and environmental adaptation in an HMMbased speech recognition system. In particular, transformations that are trained in a maximum likelihood sense on adaptation data are investigated. Other than in the form of a simple bias ..."
Abstract

Cited by 550 (66 self)
 Add to MetaCart
) constrained, which requires the variance transform to have the same form as the mean transform (sometimes referred to as featurespace transforms). Reestimation formulae for all appropriate cases of transform are given. This includes a new and efficient "full" variance transform and the extension
Evaluating 2dnf formulas on ciphertexts
 In proceedings of TCC ’05, LNCS series
, 2005
"... Abstract. Let ψ be a 2DNF formula on boolean variables x1,..., xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,..., xn. In other words, given the encryption of the bits x1,..., xn, anyone can create th ..."
Abstract

Cited by 227 (7 self)
 Add to MetaCart
Abstract. Let ψ be a 2DNF formula on boolean variables x1,..., xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,..., xn. In other words, given the encryption of the bits x1,..., xn, anyone can create
Ktheory for operator algebras
 Mathematical Sciences Research Institute Publications
, 1998
"... p. XII line5: since p. 12: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The RieszFischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract

Cited by 557 (0 self)
 Add to MetaCart
p. XII line5: since p. 12: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The RieszFischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b
Learning Talagrand DNF Formulas
"... Consider the following version of Talagrand’s probabilistic construction of a monotone function f: {0, 1} n → {0, 1}. Let f be an nterm monotone DNF formula where each term is selected independently and uniformly at random (with replacement) from the set of all n Ω(log log n) possible terms of leng ..."
Abstract
 Add to MetaCart
Consider the following version of Talagrand’s probabilistic construction of a monotone function f: {0, 1} n → {0, 1}. Let f be an nterm monotone DNF formula where each term is selected independently and uniformly at random (with replacement) from the set of all n Ω(log log n) possible terms
Results 1  10
of
1,080,909