1622 search results - page 67 / 325 » Learning a Hidden Matching |
124
click to vote
FC
2006
Springer
15 years 6 months ago
2006
Springer
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
120
click to vote
ML
2002
ACM
15 years 2 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
ACCV
2007
Springer
15 years 9 months ago
2007
Springer
The traditional co-training algorithm, which needs a great number of unlabeled examples in advance and then trains classifiers by iterative learning approach, is not suitable for ...
139
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Virtually all currently available microRNA target site prediction algorithms require the presence of a (conserved) seed match to the 5' end of the microRNA. Recen...
142
click to vote
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...