181 search results - page 20 / 37 » On Quantification with A Finite Universe |
CADE
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
APAL
2002
13 years 7 months ago
2002
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...
292
click to vote
Lecture Notes
Easy and neat set of lecture notes in Medical Image Analysis taught at West Virginia University by Prof. Tim McGraw. It covers several famous computer vision techniques such as act...