4850 search results - page 85 / 970 » Proof and Computation in Geometry |
157
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
152
click to vote
CSFW
2007
IEEE
16 years 20 days ago
2007
IEEE
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
145
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
157
click to vote
TABLEAUX
1995
Springer
15 years 10 months ago
1995
Springer
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...
169
click to vote
SGP
2003
15 years 7 months ago
2003
We propose a scheme for modeling point sample geometry with statistical analysis. In our scheme we depart from the current schemes that deterministically represent the attributes ...