Sciweavers

2517 search results - page 31 / 504
» Specifying Weak Sets
Sort
View
ICPR
2008
IEEE
16 years 1 months ago
Weakly supervised learning using proportion-based information: An application to fisheries acoustics
This paper addresses the inference of probabilistic classification models using weakly supervised learning. In contrast to previous work, the use of proportion-based training data...
Carla Scalarin, Jacques Masse, Jean-Marc Boucher, ...
IR
2010
14 years 9 months ago
Statistical query expansion for sentence retrieval and its effects on weak and strong queries
The retrieval of sentences that are relevant to a given information need is a challenging passage retrieval task. In this context, the well-known vocabulary mismatch problem arises...
David E. Losada
ICC
2007
IEEE
124views Communications» more  ICC 2007»
15 years 6 months ago
Quantization Effects in Low-Density Parity-Check Decoders
−A class of combinatorial structures, called absorbing sets, strongly influences the performance of low-density paritycheck (LDPC) decoders. In particular, the quantization schem...
Zhengya Zhang, Lara Dolecek, Martin J. Wainwright,...
EPEW
2006
Springer
15 years 1 months ago
Embedding Real Time in Stochastic Process Algebras
We present a stochastic process algebra including immediate actions, deadlock and termination, and explicit stochastic delays, in the setting of weak choice between immediate actio...
Jasen Markovski, Erik P. de Vink
PRL
2008
213views more  PRL 2008»
14 years 11 months ago
Boosting recombined weak classifiers
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
Juan José Rodríguez, Jesús Ma...