CVPR
2012
IEEE
12 years 3 months ago
2012
IEEE
In this paper we present a novel method for foreground segmentation. Our proposed approach follows a nonparametric background modeling paradigm, thus the background is modeled by ...
IACR
2011
13 years 5 days ago
2011
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
STVR
2010
13 years 7 months ago
2010
As we move to developing object-oriented programs, the complexity traditionally found in functions and procedures is moving to the connections among components. Different faults o...
KI
2007
Springer
14 years 12 days ago
2007
Springer
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
JMLR
2006
14 years 15 days ago
2006
We present Variable Influence Structure Analysis, or VISA, an algorithm that performs hierarchical decomposition of factored Markov decision processes. VISA uses a dynamic Bayesia...
PRICAI
2000
Springer
14 years 4 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
CDC
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract-- This paper considers when a discrete-time periodic non-homogeneous system can be transformed to a time-invariant one by using regular linear mappings of state variables,...
HYBRID
1997
Springer
14 years 4 months ago
1997
Springer
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode an algebraic or di erential equation for each state variable in ...
ICCAD
1999
IEEE
14 years 4 months ago
1999
IEEE
This paper proposes lazy group sifting for dynamic variable reordering during state traversal. The proposed method relaxes the idea of pairwise grouping of present state variables...
DAC
1999
ACM
14 years 4 months ago
1999
ACM
Approximate reachability techniques trade o accuracy for the capacity to deal with bigger designs. Cho et al 4 proposed partitioning the set of state bits into mutually disjoint s...