Sciweavers

327 search results - page 45 / 66
» A Theory of Information-Flow Labels
Sort
View
MFCS
2007
Springer
15 years 3 months ago
Traces of Term-Automatic Graphs
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
Antoine Meyer
FLAIRS
2004
14 years 11 months ago
VENUS: A System for Novelty Detection in Video Streams with Learning
Novelty detection in video is a rapidly developing application domain within computer vision. The motivation behind this paper is a learning based framework for detecting novelty ...
Roger S. Gaborski, Vishal S. Vaingankar, Vineet Ch...
IANDC
2006
103views more  IANDC 2006»
14 years 9 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
JCT
2007
133views more  JCT 2007»
14 years 9 months ago
Biased graphs. VII. Contrabalance and antivoltages
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
Thomas Zaslavsky
JMIV
1998
93views more  JMIV 1998»
14 years 9 months ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra