Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICASSP
/
Paper
Convex approximation of the NP-hard search problem in feature subset selection.
Tofigh Naghibi
,
Sarah Hoffmann
,
Beat Pfister
Venue
Multiconference
ICASSP
Year
2013
Proceedings
ICASSP
DBLP record
conf/icassp/NaghibiHP13 ↗
Browse the full
ICASSP paper archive
.