Results 1  10
of
1,561
A tutorial on support vector machines for pattern recognition
 Data Mining and Knowledge Discovery
, 1998
"... The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and nonseparable data, working through a nontrivial example in detail. We describe a mechanical analogy, and discuss when SV ..."
Abstract

Cited by 3393 (12 self)
 Add to MetaCart
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and nonseparable data, working through a nontrivial example in detail. We describe a mechanical analogy, and discuss when
StepIndexed Biorthogonality: a Tutorial Example
"... The purpose of this note is to illustrate the use of stepindexing [2] combined with biorthogonality [10, 9] to construct syntactical logical relations. It walks through the details of a syntactically simple, yet nontrivial example: a proof of the “CIU Theorem ” for contextual equivalence of terms ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The purpose of this note is to illustrate the use of stepindexing [2] combined with biorthogonality [10, 9] to construct syntactical logical relations. It walks through the details of a syntactically simple, yet nontrivial example: a proof of the “CIU Theorem ” for contextual equivalence of terms
A tutorial on particle filters for online nonlinear/nonGaussian Bayesian tracking
 IEEE TRANSACTIONS ON SIGNAL PROCESSING
, 2002
"... Increasingly, for many application areas, it is becoming important to include elements of nonlinearity and nonGaussianity in order to model accurately the underlying dynamics of a physical system. Moreover, it is typically crucial to process data online as it arrives, both from the point of view o ..."
Abstract

Cited by 2006 (2 self)
 Add to MetaCart
importance sampling (SIS) algorithm. These are discussed and compared with the standard EKF through an illustrative example.
Tutorial example of Gaussian Process prior Modelling Applied to Twintank System
"... Gaussian process priors are used to model a twintank system as a tutorial example in the use of Gaussian process priors in the context of dynamic systems modelling. The model learned provides a good description of the real system, and the advantages of inputdependent uncertainty and propagation of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Gaussian process priors are used to model a twintank system as a tutorial example in the use of Gaussian process priors in the context of dynamic systems modelling. The model learned provides a good description of the real system, and the advantages of inputdependent uncertainty and propagation
SIS: A System for Sequential Circuit Synthesis
, 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput b ..."
Abstract

Cited by 527 (44 self)
 Add to MetaCart
, new logic optimization and verification algorithms, ASTG (asynchronous signal transition graph) manipulation, and synthesis for PGA’s (programmable gate arrays). The second part contains a tutorial example illustrating the design process using SIS.
The protection of information in computer systems
"... This tutorial paper explores the mechanics of protecting computerstored information from unauthorized use or modification. It concentrates on those architectural structureswhether hardware or softwarethat are necessary to support information protection. The paper develops in three main sectio ..."
Abstract

Cited by 824 (2 self)
 Add to MetaCart
This tutorial paper explores the mechanics of protecting computerstored information from unauthorized use or modification. It concentrates on those architectural structureswhether hardware or softwarethat are necessary to support information protection. The paper develops in three main
A Tutorial Example of the Semantic Approach to Foundational ProofCarrying Code
 PROC. SIXTEENTH INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS, LECTURE NOTES IN COMPUTER SCIENCE 3465
, 2005
"... Proofcarrying code provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set of axioms and inference rules. In addition to a compiled program, the code producer delivers a formal proof of safety ex ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
machine code programs. This organization is presented using a detailed example. The example, as well as illustrating the above mentioned approach to organizing proofs, is designed to provide a tutorial introduction to a variety of facets of our FPCC approach. For example, it illustrates how to prove
IOS Press Tutorial Examples of the Semantic Approach to Foundational ProofCarrying Code
"... Abstract. Proofcarrying code provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set of axioms and inference rules. In addition to a compiled program, the code producer delivers a formal proof of ..."
Abstract
 Add to MetaCart
about machine code programs. This organization is presented using two running examples. The examples, as well as illustrating the above mentioned approach to organizing proofs, is designed to provide a tutorial introduction to a variety of facets of our FPCC approach. For example, it illustrates how
Stepindexed models of callbyname: a tutorial example
, 2014
"... In this tutorial paper we show how to construct a stepindexed logical relation for a callbyname programming language with recursive types and show that it is complete with respect to contextual equivalence. We then show how the same constructions can be used to define a stepindexed model, in the ..."
Abstract
 Add to MetaCart
In this tutorial paper we show how to construct a stepindexed logical relation for a callbyname programming language with recursive types and show that it is complete with respect to contextual equivalence. We then show how the same constructions can be used to define a stepindexed model
Evolutionarily Stable Strategies and Dynamics Tutorial, Example, and Open Problems
"... Abstract We provide an introduction to the topic of evolutionarily stable strategies and their relations to the stability of the socalled replicator dynamics. We also provide an example of a non trivial mixed ESS in infinite dimemsion, something apparently missing in the literature so far. We end ..."
Abstract
 Add to MetaCart
Abstract We provide an introduction to the topic of evolutionarily stable strategies and their relations to the stability of the socalled replicator dynamics. We also provide an example of a non trivial mixed ESS in infinite dimemsion, something apparently missing in the literature so far. We end
Results 1  10
of
1,561