Results 1  10
of
703,625
The Infinite Hidden Markov Model
 Machine Learning
, 2002
"... We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integrate out the infinitely many transition parameters, leaving only three hyperparameters which can be learned from data. Th ..."
Abstract

Cited by 631 (41 self)
 Add to MetaCart
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integrate out the infinitely many transition parameters, leaving only three hyperparameters which can be learned from data
Comparing Infinite Sets Expository Paper
, 2006
"... I have been assigned to explore the theorem stating that there is no largest (infinite) set as established and proven by Georg Cantor. To do this I need to start by defining what it means to say that a set is infinite. This can be quite difficult because the tendency might be to say that a set is in ..."
Abstract
 Add to MetaCart
I have been assigned to explore the theorem stating that there is no largest (infinite) set as established and proven by Georg Cantor. To do this I need to start by defining what it means to say that a set is infinite. This can be quite difficult because the tendency might be to say that a set
Infinite Set Unification with Application to Categorial Grammar
, 1997
"... In this paper the notion of unifier is extended to the infinite set case. The proof of existence of the most general unier of any infinite, unifiable set of types (terms) is presented. Learning procedure, based on infinite set unification, is described. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In this paper the notion of unifier is extended to the infinite set case. The proof of existence of the most general unier of any infinite, unifiable set of types (terms) is presented. Learning procedure, based on infinite set unification, is described.
Monoidal intervals of clones on infinite sets
 Discrete Math
"... Abstract. Let X be an infinite set of cardinality κ. We show that if L is an algebraic and dually algebraic distributive lattice with at most 2κ completely join irreducibles, then there exists a monoidal interval in the clone lattice on X which is isomorphic to the lattice 1 + L obtained by adding ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Let X be an infinite set of cardinality κ. We show that if L is an algebraic and dually algebraic distributive lattice with at most 2κ completely join irreducibles, then there exists a monoidal interval in the clone lattice on X which is isomorphic to the lattice 1 + L obtained by adding
Infinite sets that admit fast exhaustive search
 In Proceedings of the 22nd Annual IEEE Symposium on Logic In Computer Science
, 2007
"... Abstract. Perhaps surprisingly, there are infinite sets that admit mechanical exhaustive search in finite time. We investigate three related questions: What kinds of infinite sets admit mechanical exhaustive search in finite time? How do we systematically build such sets? How fast can exhaustive sea ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
Abstract. Perhaps surprisingly, there are infinite sets that admit mechanical exhaustive search in finite time. We investigate three related questions: What kinds of infinite sets admit mechanical exhaustive search in finite time? How do we systematically build such sets? How fast can exhaustive
Lattice Paths With An Infinite Set Of Jumps
, 2002
"... Whereas walks on N with a finite set of jumps were the subject of numerous studies, walks with an infinite number of jumps remain quite rarely studied. Even for relatively well structured models, the classical approach with contextfree grammars fails as we deal with rewriting rules over an infinite ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Whereas walks on N with a finite set of jumps were the subject of numerous studies, walks with an infinite number of jumps remain quite rarely studied. Even for relatively well structured models, the classical approach with contextfree grammars fails as we deal with rewriting rules over
Unification of Infinite Sets of Terms Schematized by Primal Grammars
 THEORETICAL COMPUTER SCIENCE
, 1996
"... Infinite sets of terms appear frequently at different places in computer science. On the other hand, several practically oriented parts of logic and computer science require the manipulated objects to be finite or finitely representable. Schematizations present a suitable formalism to manipulate fin ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
Infinite sets of terms appear frequently at different places in computer science. On the other hand, several practically oriented parts of logic and computer science require the manipulated objects to be finite or finitely representable. Schematizations present a suitable formalism to manipulate
Online Encoding Algorithm for Infinite Set
"... In this paper we present online encoding and decoding algorithms for an infinite input alphabet. The wellknown encoding algorithm that explicitly constructs the optimal codes is proposed by Huffman. This algorithm is clearly inappropriate for online encoding because the whole input data are not kno ..."
Abstract
 Add to MetaCart
In this paper we present online encoding and decoding algorithms for an infinite input alphabet. The wellknown encoding algorithm that explicitly constructs the optimal codes is proposed by Huffman. This algorithm is clearly inappropriate for online encoding because the whole input data
Results 1  10
of
703,625