Sciweavers

70 search results - page 5 / 14
» A computational introduction to number theory and algebra
Sort
View
87
Voted
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 2 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
ICALP
2005
Springer
15 years 3 months ago
Combining Intruder Theories
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
Yannick Chevalier, Michaël Rusinowitch
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 1 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
BIRTHDAY
2005
Springer
15 years 3 months ago
Fibring Logics: Past, Present and Future
This paper is a guided tour through the theory of fibring as a general mechanism for combining logics. We present the main ideas, constructions and difficulties of fibring, from ...
Carlos Caleiro, Amílcar Sernadas, Cristina ...
TPHOL
2005
IEEE
15 years 3 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison