Sciweavers

19866 search results - page 363 / 3974
» Computing all factorizations in ***
Sort
View
COMGEO
2006
ACM
15 years 6 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev
167
Voted
TCS
2008
15 years 6 months ago
Sound and complete computational interpretation of symbolic hashes in the standard model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
Flavio D. Garcia, Peter van Rossum
CIE
2007
Springer
16 years 1 months ago
Computability and Incomputability
The conventional wisdom presented in most computability books and historical papers is that there were several researchers in the early 1930’s working on various precise defini...
Robert I. Soare
WOLLIC
2007
Springer
16 years 28 days ago
Computational Interpretations of Classical Linear Logic
We survey several computational interpretations of classical linear logic based on two-player one-move games. The moves of the games are higherorder functionals in the language of ...
Paulo Oliva
CIE
2005
Springer
16 years 10 days ago
On the Turing Degrees of Divergence Bounded Computable Reals
The d-c.e. (difference of c.e.) and dbc (divergence bounded computable) reals are two important subclasses of ∆0 2-reals which have very interesting computability-theoretical as...
Robert Rettinger, Xizhong Zheng