Deterministic and iterative solutions to subset selection problems

DOI10.1109/TSP.2002.1011200MaRDI QIDQ5353678zbMATH OpenFDO

Authors Mohammed Nafie, Ahmed H. Tewfik, Murtaza Ali

Publication date 8 September 2017

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2002.1011200

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(9)

• LATIN 2004: Theoretical Informatics
• Determinant and Exchange Algorithms for Observation Subset Selection
• When do stepwise algorithms meet subset selection criteria?
• Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
• An implicit enumeration scheme for the batch selection problem
• Consistent subsets: computationally feasible methods to compute the Houtman-Maks-index
• On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
• scientific article; zbMATH DE number 3940420 (Why is no real title available?)
• On the General Position Subset Selection Problem

This page was built for publication: Deterministic and iterative solutions to subset selection problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353678)