Sciweavers

2687 search results - page 247 / 538
» Formal Analysis of PKCS
Sort
View
NLE
2008
106views more  NLE 2008»
15 years 6 months ago
Robust parsing and spoken negotiative dialogue with databases
This paper presents a robust parsing algorithm and semantic formalism for the interpretation of utterances in spoken negotiative dialogue with databases. The algorithm works in tw...
Johan Boye, Mats Wirén
RSA
2010
94views more  RSA 2010»
15 years 5 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
JDCTA
2010
187views more  JDCTA 2010»
15 years 1 months ago
Automatic Verification of Security Properties in Remote Internet Voting Protocol with Applied Pi Calculus
Soundness and coercion resistance are the important and intricate security requirements for remote voting protocols. Several formal models of soundness and coercion-resistance hav...
Bo Meng, Wei Huang, Zimao Li, Dejun Wang
TYPES
2000
Springer
15 years 10 months ago
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
BMCBI
2007
146views more  BMCBI 2007»
15 years 6 months ago
Spatial location and its relevance for terminological inferences in bio-ontologies
Background: An adequate and expressive ontological representation of biological organisms and their parts requires formal reasoning mechanisms for their relations of physical aggr...
Stefan Schulz, Kornél G. Markó, Udo ...