Sciweavers

140 search results - page 6 / 28
» Orderings and Constraints: Theory and Practice of Proving Te...
Sort
View
72
Voted
IJCV
2006
94views more  IJCV 2006»
14 years 9 months ago
Four Points in Two or Three Calibrated Views: Theory and Practice
Suppose two perspective views of four world points are given and that the intrinsic parameters are known but the camera poses and the world point positions are not. We prove that t...
David Nistér, Frederik Schaffalitzky
111
Voted
NETWORKS
2011
14 years 11 days ago
On terminal delta-wye reducibility of planar graphs
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
Isidoro Gitler, Feliu Sagols
JCST
2010
189views more  JCST 2010»
14 years 4 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
81
Voted
JAR
2008
88views more  JAR 2008»
14 years 9 months ago
Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables
Statistical quantities, such as expectation (mean) and variance, play a vital role in the present age probabilistic analysis. In this paper, we present some formalization of expect...
Osman Hasan, Sofiène Tahar
FASE
2001
Springer
15 years 2 months ago
A Logic for the Java Modeling Language JML
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
Bart Jacobs, Erik Poll