Results 41 to 50 of about 240,562 (189)
A study of discrete wavelet transform based denoising to reduce the effect of artificial light interferences for indoor optical wireless communication [PDF]
, 2010 The optical power penalty (OPP) due to the artificial light interferences (ALIs) can be significantly high in an indoor optical wireless communication (OWC) channel making such link practically infeasible.
Angelova, Maia +2 more
core +1 more source
Efficient Mincuts Identification for Phased-Mission Systems
IEEE Access, 2020 Fault Tree is an important model for reliability and safety assessment. The analysis performed on a fault tree can be either qualitative or quantitative. Both types of analyses may involve identifying minimal cut sets (MCS) or mincuts, each of which is a
Yuchang Mo +3 more
doaj +1 more source
CMOS Architectures and circuits for high-speed decision-making from image flows [PDF]
, 2008 We present architectures, CMOS circuits and CMOS chips to process image flows at very high speed. This is achieved by exploiting bio-inspiration and performing processing tasks in parallel manner and concurrently with image acquisition.
Alba, Luis +8 more
core +1 more source
A Fast Compiler for NetKAT [PDF]
, 2015 High-level programming languages play a key role in a growing number of networking platforms, streamlining application development and enabling precise formal reasoning about network behavior. Unfortunately, current compilers only handle "local" programs
Eliopoulos, Spiridon +3 more
core +1 more source
Optimization Bounds from Binary Decision Diagrams
INFORMS Journal on Computing, 2014 We explore the idea of obtaining bounds on the value of an optimization problem from a discrete relaxation based on binary decision diagrams (BDDs). We show how to construct a BDD that represents a relaxation of a 0-1 optimization problem, and how to obtain a bound for a separable objective function by solving a shortest (or longest) path problem in ...
Bergman, David +3 more
openaire +2 more sources
DenseZDD: A Compact and Fast Index for Families of Sets †
Algorithms, 2018 In this article, we propose a succinct data structure of zero-suppressed binary decision diagrams (ZDDs). A ZDD represents sets of combinations efficiently and we can perform various set operations on the ZDD without explicitly extracting combinations ...
Shuhei Denzumi +5 more
doaj +1 more source
Network Simplification and K-Terminal Reliability Evaluation of Sensor-Cloud Systems
IEEE Access, 2020 The sensor-cloud system (SCS) integrates sensors, sensor networks, and cloud for managing sensors, collecting and processing data, and decision-making based on data processed.
Yuchang Mo +4 more
doaj +1 more source
On OBDDs for CNFs of bounded treewidth [PDF]
, 2014 In this paper we show that a CNF cannot be compiled into an Ordered Binary Decision Diagram (OBDD) of fixed-parameter size parameterized by the primal graph treewidth of the input CNF.
Razgon, Igor
core +2 more sources
Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability [PDF]
, 2018 We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm is based on exchanging hard messages iteratively and exploiting channel reliabilities to make hard decisions at each iteration. Performance improvements up
Amat, Alexandre Graell i +2 more
core +2 more sources
Reasoning with ordered binary decision diagrams
Discrete Applied Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Horiyama, Takashi, Ibaraki, Toshihide
openaire +1 more source