Sciweavers

ICASSP
2011
IEEE
13 years 3 months ago
A region based approach to background modeling in a wavelet multi-resolution framework
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 ...
Ainhoa Mendizabal, Luis Salgado
TIT
2010
98views Education» more  TIT 2010»
13 years 6 months ago
Pairwise intersession network coding on directed networks
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 ...
Chih-Chun Wang, Ness B. Shroff
JOLLI
2011
70views more  JOLLI 2011»
13 years 6 months ago
Typability in Partial Applicative Structures
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...
Inge Bethke, Piet Rodenburg
FUIN
2010
111views more  FUIN 2010»
13 years 8 months ago
Linearity, Non-determinism and Solvability
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 ...
Michele Pagani, Simona Ronchi Della Rocca
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
13 years 9 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
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...
Vincent Limouzy
COMBINATORICS
2002
77views more  COMBINATORICS 2002»
13 years 11 months ago
Motzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns
We obtain a characterization of (321, 3
William Y. C. Chen, Eva Yu-Ping Deng, Laura L. M. ...
TAAS
2008
70views more  TAAS 2008»
13 years 11 months ago
A general characterization of indulgence
characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several result...
Rachid Guerraoui, Nancy A. Lynch
MST
2006
92views more  MST 2006»
13 years 11 months ago
Some Results on Effective Randomness
We investigate the characterizations of effective randomness in terms of Martin-L
Wolfgang Merkle, Nenad Mihailovic, Theodore A. Sla...
FUIN
2007
91views more  FUIN 2007»
13 years 11 months ago
On Communicating Automata with Bounded Channels
Abstract. We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels. These results rely on the theor...
Blaise Genest, Dietrich Kuske, Anca Muscholl
EJC
2007
13 years 11 months ago
Root shadow spaces
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 ...
Arjeh M. Cohen, Gábor Ivanyos