Sciweavers

4850 search results - page 298 / 970
» Proof and Computation in Geometry
Sort
View
ACSAC
2006
IEEE
16 years 24 days ago
Engineering Sufficiently Secure Computing
We propose an architecture of four complimentary technologies increasingly relevant to a growing number of home users and organizations: cryptography, separation kernels, formal v...
Brian Witten
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
15 years 10 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
APAL
2002
77views more  APAL 2002»
15 years 6 months ago
Degree spectra and computable dimensions in algebraic structures
Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classe...
Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richar...
TLCA
2007
Springer
16 years 25 days ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek
CVPR
2007
IEEE
16 years 8 months ago
A minimal solution to the autocalibration of radial distortion
Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems and solved from a minimal number of image points. Finding ...
Tomás Pajdla, Zuzana Kukelova