Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
9,409
Integrable systems on the lattice and orthogonal polynomials of discrete variable
- J. Computat. Appl. Math
"... discrete variable ..."
The Case of Discrete Variables in
, 2011
"... In a seminal paper, Racine and Li, (Journal of Econometrics, 2004) introduce a tool which admits discrete and categorical variables as regressors in nonparametric regres-sions. The method is similar to the smoothing techniques for continuous regressors but uses discrete kernels. In the literature, i ..."
Abstract
- Add to MetaCart
In a seminal paper, Racine and Li, (Journal of Econometrics, 2004) introduce a tool which admits discrete and categorical variables as regressors in nonparametric regres-sions. The method is similar to the smoothing techniques for continuous regressors but uses discrete kernels. In the literature
MIXED MNL MODELS FOR DISCRETE RESPONSE
- JOURNAL OF APPLIED ECONOMETRICS J. APPL. ECON. 15: 447--470 (2000)
, 2000
"... This paper considers mixed, or random coefficients, multinomial logit (MMNL) models for discrete response, and establishes the following results. Under mild regularity conditions, any discrete choice model derived from random utility maximization has choice probabilities that can be approximated as ..."
Abstract
-
Cited by 487 (15 self)
- Add to MetaCart
specification can be tested simply as an omitted variable test with appropriately defined artificial variables. An application to a problem of demand for alternative vehicles shows that MMNL provides a flexible and computationally practical approach to discrete response analysis.
Approximating discrete probability distributions with dependence trees
- IEEE TRANSACTIONS ON INFORMATION THEORY
, 1968
"... A method is presented to approximate optimally an n-dimensional discrete probability distribution by a product of second-order distributions, or the distribution of the first-order tree dependence. The problem is to find an optimum set of n-1 first order dependence relationship among the n variables ..."
Abstract
-
Cited by 881 (0 self)
- Add to MetaCart
A method is presented to approximate optimally an n-dimensional discrete probability distribution by a product of second-order distributions, or the distribution of the first-order tree dependence. The problem is to find an optimum set of n-1 first order dependence relationship among the n
Kernel Machines for Continuous and Discrete Variables
"... Abstract. Kernel Machines, such as Support Vector Machines, have been frequently used, with considerable success, in situations in which the input variables were real values. Lately, these methods have also been extended to deal with discrete data such as string characters, microarray gene expressio ..."
Abstract
- Add to MetaCart
Abstract. Kernel Machines, such as Support Vector Machines, have been frequently used, with considerable success, in situations in which the input variables were real values. Lately, these methods have also been extended to deal with discrete data such as string characters, microarray gene
Efficient reconciliation protocol for discrete-variable
, 2009
"... Reconciliation is an essential part of any secret-key agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of informati ..."
Abstract
-
Cited by 13 (4 self)
- Add to MetaCart
of information. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with Low Density Parity Check (LDPC) codes optimized for the BSC. In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate
Maximum Likelihood Phylogenetic Estimation from DNA Sequences with Variable Rates over Sites: Approximate Methods
- J. Mol. Evol
, 1994
"... Two approximate methods are proposed for maximum likelihood phylogenetic estimation, which allow variable rates of substitution across nucleotide sites. Three data sets with quite different characteristics were analyzed to examine empirically the performance of these methods. The first, called ..."
Abstract
-
Cited by 557 (29 self)
- Add to MetaCart
Two approximate methods are proposed for maximum likelihood phylogenetic estimation, which allow variable rates of substitution across nucleotide sites. Three data sets with quite different characteristics were analyzed to examine empirically the performance of these methods. The first, called
The omnet++ discrete event simulation system
- In ESM’01
, 2001
"... performance analysis, computer systems, telecommunications, hierarchical The paper introduces OMNeT++, a C++-based discrete event simulation package primarily targeted at simulating computer networks and other distributed systems. OMNeT++ is fully programmable and modular, and it was designed from t ..."
Abstract
-
Cited by 418 (1 self)
- Add to MetaCart
performance analysis, computer systems, telecommunications, hierarchical The paper introduces OMNeT++, a C++-based discrete event simulation package primarily targeted at simulating computer networks and other distributed systems. OMNeT++ is fully programmable and modular, and it was designed from
The algorithmic analysis of hybrid systems
- THEORETICAL COMPUTER SCIENCE
, 1995
"... We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamica ..."
Abstract
-
Cited by 778 (71 self)
- Add to MetaCart
We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according
Results 1 - 10
of
9,409
