ICASSP
2011
IEEE
13 years 4 months ago
2011
IEEE
In the field of detection and monitoring of dynamic objects in quasi-static scenes, background subtraction techniques where background is modeled at pixel-level, although showing ...
TIT
2010
13 years 7 months ago
2010
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
JOLLI
2011
13 years 7 months ago
2011
Adapting a claim of Kracht (Theor Comput Sci 354:131–141, 2006), we establish a characterization of the typable partial applicative structures. Keywords Partial applicative struc...
FUIN
2010
13 years 10 months ago
2010
We study the notion of solvability in the resource calculus, an extension of the -calculus modelling resource consumption. Since this calculus is non-deterministic, two different ...
ISAAC
2010
Springer
13 years 10 months ago
2010
Springer
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
COMBINATORICS
2002
14 years 12 days ago
2002
We obtain a characterization of (321, 3
TAAS
2008
14 years 14 days ago
2008
characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several result...
MST
2006
14 years 15 days ago
2006
We investigate the characterizations of effective randomness in terms of Martin-L
FUIN
2007
14 years 15 days ago
2007
Abstract. We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels. These results rely on the theor...
EJC
2007
14 years 16 days ago
2007
We give a characterization of the root shadow spaces of buildings whose types correspond to Dynkin diagrams. The results generalize earlier geometric point-line characterizations ...