Sciweavers

3228 search results - page 337 / 646
» Computationally Sound Proofs
Sort
View
APIN
2000
103views more  APIN 2000»
15 years 4 months ago
Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...
Brian J. Ross
CSUR
1999
114views more  CSUR 1999»
15 years 3 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
160
Voted
SAC
2008
ACM
15 years 3 months ago
A framework for performance evaluation and functional verification in stochastic process algebras
Despite its relatively short history, a wealth of formalisms exist for algebraic specification of stochastic systems. The goal of this paper is to give such formalisms a unifying ...
Hossein Hojjat, Mohammad Reza Mousavi, Marjan Sirj...
BIRTHDAY
2010
Springer
15 years 1 months ago
Strict Canonical Constructive Systems
We define the notions of a canonical inference rule and a canonical constructive system in the framework of strict single-conclusion Gentzen-type systems (or, equivalently, natural...
Arnon Avron, Ori Lahav
ICCV
2007
IEEE
15 years 10 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...