Sciweavers

634 search results - page 108 / 127
» Completion Procedures as Semidecision Procedures
Sort
View
ICCV
2011
IEEE
12 years 8 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille
CADE
2011
Springer
12 years 8 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
FROCOS
2000
Springer
14 years 1 days ago
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
Paqui Lucio
DLOG
2011
12 years 12 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese
IACR
2011
135views more  IACR 2011»
12 years 8 months ago
An Improved Internet Voting Protocol
Norway is going to experience an Internet voting scheme in September 2011 for local governmental elections, targeting a comprehensive Internet voting system in 2017 for national el...
Mehmet Sabir Kiraz, Süleyman Kardas, Muhammed...