"Convex approximation of the NP-hard search problem in feature subset ..."

Tofigh Naghibi, Sarah Hoffmann, Beat Pfister (2013)

> Home

Details and statistics

DOI: 10.1109/ICASSP.2013.6638263

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icassp/NaghibiHP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/NaghibiHP13
Tofigh Naghibi, Sarah Hoffmann, Beat Pfister:
Convex approximation of the NP-hard search problem in feature subset selection. ICASSP 2013: 3273-3277

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.