Sciweavers

513 search results - page 19 / 103
» Finitely Based, Finite Sets of Words
Sort
View
AUTOMATICA
2008
51views more  AUTOMATICA 2008»
14 years 12 months ago
New method for identifying finite degree Volterra series
In this paper, the identification of a class of nonlinear systems which admits input-output maps described by a finite degree Volterra series is considered. In actual fact, it app...
Wael Suleiman, André Monin
JUCS
2006
121views more  JUCS 2006»
14 years 11 months ago
On-line Monitoring of Metric Temporal Logic with Time-Series Constraints Using Alternating Finite Automata
: In this paper we describe a technique for monitoring and checking temporal logic assertions augmented with real-time and time-series constraints, or Metric Temporal Logic Series ...
Doron Drusinsky
FDTC
2006
Springer
80views Cryptology» more  FDTC 2006»
15 years 3 months ago
Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring ...
Gunnar Gaubatz, Berk Sunar
COLT
1995
Springer
15 years 3 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
ICISC
2008
129views Cryptology» more  ICISC 2008»
15 years 1 months ago
Novel PUF-Based Error Detection Methods in Finite State Machines
We propose a number of techniques for securing finite state machines (FSMs) against fault injection attacks. The proposed security mechanisms are based on physically unclonable fun...
Ghaith Hammouri, Kahraman D. Akdemir, Berk Sunar