3607 search results - page 594 / 722 » Learning with structured sparsity |
151
Voted
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
147
click to vote
HT
2005
ACM
15 years 10 months ago
2005
ACM
In recent years, many algorithms for the Web have been developed that work with information units distinct from individual web pages. These include segments of web pages or aggreg...
142
Voted
BMCV
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We apply independent component analysis (ICA) for learning an efficient color image representation of natural scenes. In the spectra of single pixels, the algorithm was a...
154
click to vote
FLAIRS
2010
15 years 6 months ago
2010
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
153
click to vote
AAAI
2008
15 years 6 months ago
2008
Classification of texts potentially containing a complex and specific terminology requires the use of learning methods that do not rely on extensive feature engineering. In this w...