Sciweavers

215 search results - page 14 / 43
» Algebraic simulations
Sort
View
JAR
2006
236views more  JAR 2006»
13 years 9 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
ASIACRYPT
2001
Springer
14 years 1 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
ICCS
2007
Springer
14 years 1 months ago
Formal Verification of Analog and Mixed Signal Designs in Mathematica
In this paper, we show how symbolic algebra in Mathematica can be used to formally verify analog and mixed signal designs. The verification methodology is based on combining induct...
Mohamed H. Zaki, Ghiath Al Sammane, Sofiène...
ENTCS
2010
119views more  ENTCS 2010»
13 years 10 months ago
Bio-PEPA for Epidemiological Models
Many models have been defined in order to describe the evolution of a disease in a population. The modelling of diseases is helpful to understand the mechanisms for their spread a...
Federica Ciocchetta, Jane Hillston
ICASSP
2011
IEEE
13 years 1 months ago
An ALPS view of sparse recovery
We provide two compressive sensing (CS) recovery algorithms based on iterative hard-thresholding. The algorithms, collectively dubbed as algebraic pursuits (ALPS), exploit the res...
Volkan Cevher