749 search results - page 96 / 150 » Combinatory Models and Symbolic Computation |
ATVA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
LICS
2003
IEEE
14 years 3 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
IDA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...
CONSTRAINTS
2011
13 years 5 months ago
2011
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...
ACCV
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. This paper deals with the classification of color video sequences using Markov Random Fields (MRF) taking into account motion information. The theoretical framework relie...