Sciweavers

Share
CVPR
2012
IEEE
7 years 24 days ago
Background segmentation with feedback: The Pixel-Based Adaptive Segmenter
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 ...
Martin Hofmann 0011, Philipp Tiefenbacher, Gerhard...
IACR
2011
91views more  IACR 2011»
7 years 10 months ago
A Scalable Method for Constructing Galois NLFSRs with Period $2^n-1$ using Cross-Join Pairs
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 ...
Elena Dubrova
STVR
2010
80views more  STVR 2010»
8 years 5 months ago
Testing coupling relationships in object-oriented programs
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...
Roger T. Alexander, Jeff Offutt, Andreas Stefik
KI
2007
Springer
8 years 10 months ago
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
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...
Emmanuel Benazera
JMLR
2006
190views more  JMLR 2006»
8 years 10 months ago
Causal Graph Based Decomposition of Factored MDPs
We present Variable Influence Structure Analysis, or VISA, an algorithm that performs hierarchical decomposition of factored Markov decision processes. VISA uses a dynamic Bayesia...
Anders Jonsson, Andrew G. Barto
PRICAI
2000
Springer
9 years 1 months ago
Generating Hierarchical Structure in Reinforcement Learning from State Variables
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 ...
Bernhard Hengst
CDC
2009
IEEE
9 years 2 months ago
Transformability from discrete-time periodic non-homogeneous systems to time-invariant ones
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,...
Yoshikazu Hayakawa, Tomohiko Jimbo
HYBRID
1997
Springer
9 years 2 months ago
Time-Deterministic Hybrid Transition Systems
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 ...
Simin Nadjm-Tehrani
ICCAD
1999
IEEE
74views Hardware» more  ICCAD 1999»
9 years 2 months ago
Lazy group sifting for efficient symbolic state traversal of FSMs
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...
Hiroyuki Higuchi, Fabio Somenzi
DAC
1999
ACM
9 years 2 months ago
Improved Approximate Reachability Using Auxiliary State Variables
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...
Shankar G. Govindaraju, David L. Dill, Jules P. Be...
books