Sciweavers

3819 search results - page 96 / 764
» Simple Easy Terms
Sort
View
AUTOMATICA
2008
92views more  AUTOMATICA 2008»
13 years 10 months ago
Generic uniform observability analysis for bilinear systems
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...
T. Boukhobza
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 10 months ago
Approximation Algorithms for Shortest Descending Paths in Terrains
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw...
DAM
2008
70views more  DAM 2008»
13 years 10 months ago
Pairings for cryptographers
Many research papers in pairing based cryptography treat pairings as a "black box". These papers build cryptographic schemes making use of various properties of pairings....
Steven D. Galbraith, Kenneth G. Paterson, Nigel P....
ENTCS
2008
90views more  ENTCS 2008»
13 years 10 months ago
Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic
The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweig...
Richard Bubel, Andreas Roth, Philipp Rümmer
ARSCOM
2006
81views more  ARSCOM 2006»
13 years 10 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon