Results 1  10
of
2,049,156
An Equivalent Form of the Fundamental Triangle Inequality and ITS APPLICATIONS
 JOURNAL OF INEQUALITIES IN PURE AND APPLIED MATHEMATICS
"... An equivalent form of the fundamental triangle inequality is given. The result is then used to obtain an improvement of the Leuenberger’s inequality and a new proof of the GarfunkelBankoff inequality. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
An equivalent form of the fundamental triangle inequality is given. The result is then used to obtain an improvement of the Leuenberger’s inequality and a new proof of the GarfunkelBankoff inequality.
Feature selection based on mutual information: Criteria of maxdependency, maxrelevance, and minredundancy
 IEEE TRANS. PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2005
"... Feature selection is an important problem for pattern classification systems. We study how to select good features according to the maximal statistical dependency criterion based on mutual information. Because of the difficulty in directly implementing the maximal dependency condition, we first der ..."
Abstract

Cited by 541 (7 self)
 Add to MetaCart
derive an equivalent form, called minimalredundancymaximalrelevance criterion (mRMR), for firstorder incremental feature selection. Then, we present a twostage feature selection algorithm by combining mRMR and other more sophisticated feature selectors (e.g., wrappers). This allows us to select a
Equivalent forms of the bessismoussavillani conjecture
 Journal of Statistical Physics
"... Dedicated with best wishes to Giovanni JonaLasinio on his 70 th birthday The BMV conjecture for traces, which states that Tr exp(A−λB) is the Laplace transform of a positive measure, is shown to be equivalent to two other statements: (i) The polynomial λ ↦ → Tr (A+λB) p has only nonnegative coeffi ..."
Abstract

Cited by 39 (1 self)
 Add to MetaCart
Dedicated with best wishes to Giovanni JonaLasinio on his 70 th birthday The BMV conjecture for traces, which states that Tr exp(A−λB) is the Laplace transform of a positive measure, is shown to be equivalent to two other statements: (i) The polynomial λ ↦ → Tr (A+λB) p has only non
Symbolic Boolean manipulation with ordered binarydecision diagrams
 ACM COMPUTING SURVEYS
, 1992
"... Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as grap ..."
Abstract

Cited by 1022 (13 self)
 Add to MetaCart
Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented
Bisimulation through probabilistic testing
 in “Conference Record of the 16th ACM Symposium on Principles of Programming Languages (POPL
, 1989
"... We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily clos ..."
Abstract

Cited by 521 (14 self)
 Add to MetaCart
close to one, between processes that are not bisimulation equivalent. We also show a similar result (in a slightly stronger form) for a new process relation called $bisimulationwhich lies strictly between that of simulation and bisimulation. Finally, the ultimately strength of the testing language
A New Extension of the Kalman Filter to Nonlinear Systems
, 1997
"... The Kalman filter(KF) is one of the most widely used methods for tracking and estimation due to its simplicity, optimality, tractability and robustness. However, the application of the KF to nonlinear systems can be difficult. The most common approach is to use the Extended Kalman Filter (EKF) which ..."
Abstract

Cited by 747 (6 self)
 Add to MetaCart
) which simply linearises all nonlinear models so that the traditional linear Kalman filter can be applied. Although the EKF (in its many forms) is a widely used filtering strategy, over thirty years of experience with it has led to a general consensus within the tracking and control community
Perspectives on Program Analysis
, 1996
"... eing analysed. On the negative side, the semantic correctness of the analysis is seldom established and therefore there is often no formal justification for the program transformations for which the information is used. The semantics based approach [1; 5] is often based on domain theory in the form ..."
Abstract

Cited by 675 (34 self)
 Add to MetaCart
in the form of abstract domains modelling sets of values, projections, or partial equivalence relations. The approach tends to focus more directly on discovering the extensional properties of interest: for constant propagation it might operate on sets of values with constancy corresponding to singletons
Constrained model predictive control: Stability and optimality
 AUTOMATICA
, 2000
"... Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon openloop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence and t ..."
Abstract

Cited by 699 (15 self)
 Add to MetaCart
Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon openloop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence
KLEE: Unassisted and Automatic Generation of HighCoverage Tests for Complex Systems Programs
"... We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentallyintensive programs. We used KLEE to thoroughly check all 89 standalone programs in the GNU COREUTILS utility suite, which form the cor ..."
Abstract

Cited by 547 (15 self)
 Add to MetaCart
We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentallyintensive programs. We used KLEE to thoroughly check all 89 standalone programs in the GNU COREUTILS utility suite, which form
Results 1  10
of
2,049,156