Results 31 to 40 of about 1,713 (291)
Adaptive Max-Margin One-Class Classifier for SAR Target Discrimination in Complex Scenes
Synthetic aperture radar (SAR) target discrimination is an important stage that distinguishes targets from clutters in the radar automatic target recognition field.
Leiyao Liao +3 more
doaj +1 more source
Joint Ship Detection Based on Time-Frequency Domain and CFAR Methods with HF Radar
Compact high-frequency surface wave radar (HFSWR) plays a critical role in ship surveillance. Due to the wide antenna beam-width and low spatial gain, traditional constant false alarm rate (CFAR) detectors often induce a low detection probability.
Zhiqing Yang +5 more
doaj +1 more source
Descomposició de clutters i dominació de grafs [PDF]
al Capítol 1 s'introdueix el concepte de graf i s'estudien algunes famílies associades a ells; al Capítol 2 es tracta el poset de clutters i, després de donar-li una estructura de lattice, s'introdueixen els conceptes d'aproximació i descomposició al ...
Forcada Carrasco, Ramon
core +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gabriela R. Argiroffo +2 more
openaire +2 more sources
Motivated by Lehman's characterization of the minor-minimal clutters without the MFMC property, we propose a conjecture about the minor-minimal clutters with ...
Ding, Guoli
core +1 more source
Transformation and decomposition of clutters into matroids [PDF]
A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of bases, and its set of hyperplanes are examples of clutters arising from matroids.
Martí Farré, Jaume +3 more
core +1 more source
Von Neumann–Morgenstern Hypergraphs
A simple hypergraph H with vertex set X and edge set E is representable by Von Neumann–Morgenstern (VNM)-stable sets—or VNM—if there exists an irreflexive simple digraph D with vertex set X such that each edge of H is a VNM-stable set of D.
Stefano Vannucci
doaj +1 more source
A note on operators of deletion and contraction for antichains
The operators of deletion and contraction for clutters are generalized to those for antichains of finite bounded posets. A generalization of the result by Seymour (1976), describing the relationship between the operators of deletion, contraction, and the
Andrey O. Matveev
doaj +1 more source
Elimination Properties for Minimal Dominating Sets of Graphs
A dominating set of a graph is a vertex subset such that every vertex not in the subset is adjacent to at least one in the subset. In this paper we study whenever there exists a new dominating set contained (respectively, containing) the subset obtained ...
Martí-Farré Jaume +3 more
doaj +1 more source
Variational Bayesian Based Adaptive Shifted Rayleigh Filter for Bearings-Only Tracking in Clutters
This paper considers bearings-only target tracking in clutters with uncertain clutter probability. The traditional shifted Rayleigh filter (SRF), which assumes known clutter probability, may have degraded performance in challenging scenarios.
Jing Hou, Yan Yang, Tian Gao
doaj +1 more source

