3607 search results - page 311 / 722 » Learning with structured sparsity |
178
click to vote
RIA
2006
15 years 6 months ago
2006
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
183
click to vote
ETAI
2000
15 years 6 months ago
2000
Stochastic logic programs combine ideas from probabilistic grammars with the expressive power of definite clause logic; as such they can be considered as an extension of probabili...
137
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
Current texture analysis methods enable good discrimination but are computationally too expensive for applications which require high frame rates. This occurs because they use red...
176
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
186
click to vote
ACL
2009
15 years 4 months ago
2009
While Active Learning (AL) has already been shown to markedly reduce the annotation efforts for many sequence labeling tasks compared to random selection, AL remains unconcerned a...