3607 search results - page 722 / 722 » Learning with structured sparsity |
126
Voted
EMNLP
2009
14 years 11 months ago
2009
Many algorithms extract terms from text together with some kind of taxonomic classification (is-a) link. However, the general approaches used today, and specifically the methods o...
157
Voted
STOC
2012
ACM
13 years 4 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...