Results 1  10
of
42,087
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 685 (12 self)
 Add to MetaCart
A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied
Latent dirichlet allocation
 Journal of Machine Learning Research
, 2003
"... We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a threelevel hierarchical Bayesian model, in which each item of a collection is modeled as a finite mixture over an underlying set of topics. Each topic is, ..."
Abstract

Cited by 4365 (92 self)
 Add to MetaCart
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a threelevel hierarchical Bayesian model, in which each item of a collection is modeled as a finite mixture over an underlying set of topics. Each topic is
Fitting a mixture model by expectation maximization to discover motifs in biopolymers.
 Proc Int Conf Intell Syst Mol Biol
, 1994
"... Abstract The algorithm described in this paper discovers one or more motifs in a collection of DNA or protein sequences by using the technique of expect~tiou ma.,dmization to fit a twocomponent finite mixture model to the set of sequences. Multiple motifs are found by fitting a mixture model to th ..."
Abstract

Cited by 947 (5 self)
 Add to MetaCart
Abstract The algorithm described in this paper discovers one or more motifs in a collection of DNA or protein sequences by using the technique of expect~tiou ma.,dmization to fit a twocomponent finite mixture model to the set of sequences. Multiple motifs are found by fitting a mixture model
Tabu Search  Part I
, 1989
"... This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu search has achieved impressive practical successes in applications ranging from scheduling and computer channel balancing to cluster analysis and space planning, and more ..."
Abstract

Cited by 680 (11 self)
 Add to MetaCart
term memory processes for intensifying and diversifying the search. Included are illustrative data structures for implementing the tabu conditions (and associated aspiration criteria) that underlie these processes. Part I concludes with a discussion of probabilistic tabu search and a summary
Bilattices and the Semantics of Logic Programming
, 1989
"... Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's fourvalued logic, based on classical twovalued logic. Among other examples are those based on finite manyvalued logics, and on prob ..."
Abstract

Cited by 446 (13 self)
 Add to MetaCart
Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's fourvalued logic, based on classical twovalued logic. Among other examples are those based on finite manyvalued logics
Tabu Search  Part II
, 1990
"... This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a probabilis ..."
Abstract

Cited by 387 (5 self)
 Add to MetaCart
probabilistic framework. Part I also reported successful applications from a wide range of settings, in which tabu search frequently made it possible to obtain higher quality solutions than previously obtained with competing strategies, generally with less computational effort. Part 11, in this issue, examines
The Complexity of Probabilistic versus Quantum Finite Automata
, 2003
"... Abstract. We present a language Ln which is recognizable by a probabilistic finite automaton (PFA) with probability 1 − ǫ for all ǫ> 0 with O(log 2 n) states, with a deterministic finite automaton (DFA) with O(n) Ω(n / log n) states, but a quantum finite automaton (QFA) needs at least 2 states. 1 ..."
Abstract
 Add to MetaCart
Abstract. We present a language Ln which is recognizable by a probabilistic finite automaton (PFA) with probability 1 − ǫ for all ǫ> 0 with O(log 2 n) states, with a deterministic finite automaton (DFA) with O(n) Ω(n / log n) states, but a quantum finite automaton (QFA) needs at least 2 states
The Complexity of Probabilistic VS Quantum Finite Automata
"... There will be presented a language L witch is recognizable by a probabilistic finite automaton (PFA) with probability 2/3  e for all e > 0 with O(log2n) states, with a deterministic finite automaton (DFA) with O(n) states, but a quantum finite automaton (QFA) needs 2.(/log ) states. ..."
Abstract
 Add to MetaCart
There will be presented a language L witch is recognizable by a probabilistic finite automaton (PFA) with probability 2/3  e for all e > 0 with O(log2n) states, with a deterministic finite automaton (DFA) with O(n) states, but a quantum finite automaton (QFA) needs 2.(/log ) states.
KullbackLeibler distance between probabilistic contextfree grammars and probabilistic finite automata
 In Proc. of the 20 th COLING
, 2004
"... We consider the problem of computing the KullbackLeibler distance, also called the relative entropy, between a probabilistic contextfree grammar and a probabilistic finite automaton. We show that there is a closedform (analytical) solution for one part of the KullbackLeibler distance, viz. the c ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider the problem of computing the KullbackLeibler distance, also called the relative entropy, between a probabilistic contextfree grammar and a probabilistic finite automaton. We show that there is a closedform (analytical) solution for one part of the KullbackLeibler distance, viz
A Fast AutomatonBased Method for Detecting Anomalous Program Behaviors
 In Proceedings of the 2001 IEEE Symposium on Security and Privacy
, 2001
"... Forrest et al introduced a new intrusion detection approach that identifies anomalous sequences of system calls executed by programs. Since their work, anomaly detection on system call sequences has become perhaps the most successful approach for detecting novel intrusions. A natural way for learnin ..."
Abstract

Cited by 224 (5 self)
 Add to MetaCart
for learning sequences is to use a finitestate automaton (FSA). However, previous research seemed to indicate that FSAlearning is computationally expensive, that it cannot be completely automated, or that the space usage of the FSA may be excessive. We present a new approach in this paper that overcomes
Results 1  10
of
42,087