Results 21 to 30 of about 264,555 (246)
IEEE Access, 2019 This paper presents an adaptive null-space-based behavioral (NSB) method to deal with the problems of saturation planning and lack of adaptability when the traditional NSB method is applied to the formation control of multiple unmanned surface vehicles ...
Jiajia Fan +5 more
doaj +1 more source
Threshold Saturation for Spatially Coupled Turbo-like Codes over the Binary Erasure Channel [PDF]
, 2015 In this paper we prove threshold saturation for spatially coupled turbo codes (SC-TCs) and braided convolutional codes (BCCs) over the binary erasure channel.
Amat, Alexandre Graell i +2 more
core +2 more sources
Systems and methods for physiological signal enhancement and biometric extraction using non-invasive optical sensors [PDF]
, 2018 A system and method for signal processing to remove unwanted noise components including: (i) wavelength-independent motion artifacts such as tissue, bone and skin effects, and (ii) wavelength-dependent motion artifact/noise components such as venous ...
Nourani, Mehrdad, Yousefi, Rasoul
core +1 more source
Weak Rainbow Saturation Numbers of Graphs [PDF]
Journal of Graph TheoryFor a fixed graph H H , we say that an edge‐colored graph G G is weakly H H ‐rainbow saturated if there exists an ordering e 1 , e 2 , … , e m e1,e2,\unicode{x02026},em of E ( G ¯ ) E(G\unicode{x000AF}) such that, for any list c 1 , c 2 , … , c m c1,c2 ...
Xihe Li, Jie Ma, Tianying Xie
semanticscholar +1 more source
The Space of Solutions of Coupled XORSAT Formulae [PDF]
, 2013 The XOR-satisfiability (XORSAT) problem deals with a system of $n$ Boolean variables and $m$ clauses. Each clause is a linear Boolean equation (XOR) of a subset of the variables. A $K$-clause is a clause involving $K$ distinct variables. In the random $K$
Hassani, S. Hamed +2 more
core +1 more source
Spatially-Coupled Random Access on Graphs [PDF]
, 2012 In this paper we investigate the effect of spatial coupling applied to the recently-proposed coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the graphical model describing the iterative interference cancelation process of ...
Chiani, Marco +3 more
core +1 more source
A Cascaded Structure for Generalized Graph Filters
IEEE Transactions on Signal Processing, 2022 One of the main challenges of graph filters is the stability of their design. While classical graph filters allow for a stable design using optimal polynomial approximation theory, generalized graph filters tend to suffer from the ill-conditioning of the
M. Coutiño, G. Leus
semanticscholar +1 more source
European Control Conference, 2022 While reaching an agreement in multi-agent sys-tems (MAS) can be ensured by enforcing some connectivity properties between agents, the consensus depends on their initial conditions and the network topology.
Daniel R. Alkhorshid +2 more
semanticscholar +1 more source
Loops and legs beyond perturbation theory
, 2000 Within the non-perturbative 1/N expansion, we discuss numerical methods for calculating multi-loop Feynman graph needed to derive physical scattering amplitudes.
Adrian Ghinculov +33 more
core +1 more source
Saturation in the Hypercube and Bootstrap Percolation [PDF]
, 2015 Let $Q_d$ denote the hypercube of dimension $d$. Given $d\geq m$, a spanning subgraph $G$ of $Q_d$ is said to be $(Q_d,Q_m)$-saturated if it does not contain $Q_m$ as a subgraph but adding any edge of $E(Q_d)\setminus E(G)$ creates a copy of $Q_m$ in $G$.
Morrison, Natasha +2 more
core +2 more sources