Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
6,583
Multiplicative transition systems
, 2009
"... The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are morphisms-only categories with respect to a partial binary operation called composition. They can be characterized by a ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are morphisms-only categories with respect to a partial binary operation called composition. They can be characterized
Multiplicative transition systems 1
"... The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are morphisms-only categories with respect to a partial binary operation called composition. They can be characterized by a ..."
Abstract
- Add to MetaCart
The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are morphisms-only categories with respect to a partial binary operation called composition. They can be characterized
Markov games as a framework for multi-agent reinforcement learning
- IN PROCEEDINGS OF THE ELEVENTH INTERNATIONAL CONFERENCE ON MACHINE LEARNING
, 1994
"... In the Markov decision process (MDP) formalization of reinforcement learning, a single adaptive agent interacts with an environment defined by a probabilistic transition function. In this solipsistic view, secondary agents can only be part of the environment and are therefore fixed in their behavior ..."
Abstract
-
Cited by 601 (13 self)
- Add to MetaCart
In the Markov decision process (MDP) formalization of reinforcement learning, a single adaptive agent interacts with an environment defined by a probabilistic transition function. In this solipsistic view, secondary agents can only be part of the environment and are therefore fixed
Comprehensive database for facial expression analysis
- in Proceedings of Fourth IEEE International Conference on Automatic Face and Gesture Recognition
"... Within the past decade, significant effort has occurred in developing methods of facial expression analysis. Because most investigators have used relatively limited data sets, the generalizability of these various methods remains unknown. We describe the problem space for facial expression analysis, ..."
Abstract
-
Cited by 593 (51 self)
- Add to MetaCart
, which includes level of description, transitions among expression, eliciting conditions, reliability and validity of training and test data, individual differences in subjects, head orientation and scene complexity, image characteristics, and relation to non-verbal behavior. We then present the CMU
IOS Press Multiplicative transition systems
"... Abstract. The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are categories with respect to a partial binary operation called composition. They can be characterized by axioms ..."
Abstract
- Add to MetaCart
Abstract. The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are categories with respect to a partial binary operation called composition. They can be characterized
A Post-Processing System To Yield Reduced Word Error Rates: Recognizer Output Voting Error Reduction (ROVER)
, 1997
"... This paper describes a system developed at NIST to produce a composite Automatic Speech Recognition (ASR) system output when the outputs of multiple ASR systems are available, and for which, in many cases, the composite ASR output has lower error rate than any of the individual systems. The system i ..."
Abstract
-
Cited by 422 (2 self)
- Add to MetaCart
This paper describes a system developed at NIST to produce a composite Automatic Speech Recognition (ASR) system output when the outputs of multiple ASR systems are available, and for which, in many cases, the composite ASR output has lower error rate than any of the individual systems. The system
Józef Winkowski MULTIPLICATIVE TRANSITION SYSTEMS 1
, 2010
"... The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are categories with respect to a partial binary operation called composition. They can be characterized by axioms such that ..."
Abstract
- Add to MetaCart
The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are categories with respect to a partial binary operation called composition. They can be characterized by axioms
Józef Winkowski MULTIPLICATIVE TRANSITION SYSTEMS 1
, 2010
"... The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are categories with respect to a partial binary operation called composition. They can be characterized by axioms such that ..."
Abstract
- Add to MetaCart
The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are categories with respect to a partial binary operation called composition. They can be characterized by axioms
Józef Winkowski MULTIPLICATIVE TRANSITION SYSTEMS 1
, 2010
"... The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are categories with respect to a partial binary operation called composition. They can be characterized by axioms such that ..."
Abstract
- Add to MetaCart
The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are categories with respect to a partial binary operation called composition. They can be characterized by axioms
Józef Winkowski MULTIPLICATIVE TRANSITION SYSTEMS 1
, 2010
"... The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are categories with respect to a partial binary operation called composition. They can be characterized by axioms such that ..."
Abstract
- Add to MetaCart
The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are categories with respect to a partial binary operation called composition. They can be characterized by axioms
Results 1 - 10
of
6,583
