Sciweavers

62 search results - page 11 / 13
» Some Quasi-Varieties of Iteration Theories
Sort
View
POPL
2007
ACM
14 years 7 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
14 years 1 months ago
A stopping criterion based on Kalman estimation techniques with several progress indicators
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
José Luis Guerrero, Jesús Garc&iacut...
CDC
2008
IEEE
120views Control Systems» more  CDC 2008»
13 years 9 months ago
Left invertibility of discrete systems with finite inputs and quantized output
Abstract-- The aim of this paper is to address left invertibility for dynamical systems with inputs and outputs in discrete sets. We study systems that evolve in discrete time with...
Nevio Dubbini, Benedetto Piccoli, Antonio Bicchi
ICB
2007
Springer
183views Biometrics» more  ICB 2007»
13 years 8 months ago
Factorial Hidden Markov Models for Gait Recognition
Gait recognition is an effective approach for human identification at a distance. During the last decade, the theory of hidden Markov models (HMMs) has been used successfully in th...
Changhong Chen, Jimin Liang, Haihong Hu, Licheng J...
JSYML
2008
72views more  JSYML 2008»
13 years 7 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson