921 search results - page 109 / 185 » Expressing Computational Complexity in Constructive Type The... |
VIS
2004
IEEE
14 years 9 months ago
2004
IEEE
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
AGENTCL
2003
Springer
14 years 1 months ago
2003
Springer
The goal of this paper is to present a computational framework that enables us to generate elementary speech act sequences in a dialogue between an electronic assistant and a compu...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
CRYPTO
1991
Springer
13 years 11 months ago
1991
Springer
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
KBSE
1997
IEEE
14 years 6 days ago
1997
IEEE
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...