3641 search results - page 377 / 729 » On Computability of Pattern Recognition Problems |
138
Voted
SIGIR
2006
ACM
15 years 11 months ago
2006
ACM
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
169
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
148
Voted
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
We assess the applicability of several popular learning methods for the problem of recognizing generic visual categories with invariance to pose, lighting, and surrounding clutter...
174
Voted
MOBICOM
2006
ACM
15 years 11 months ago
2006
ACM
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...
141
click to vote
MLDM
2009
Springer
15 years 11 months ago
2009
Springer
In two-class score-based problems the combination of scores from an ensemble of experts is generally used to obtain distributions for positive and negative patterns that exhibit a ...