641 search results - page 89 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Training a good text detector requires a large amount of labeled data, which can be very expensive to obtain. Cotraining has been shown to be a powerful semi-supervised learning t...
IMC
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we propose a model for representing and predicting distances in large-scale networks by matrix factorization. The model is useful for network distance sensitive app...
BMCBI
2008
14 years 9 months ago
2008
Background: The identification and characterization of interacting domain pairs is an important step towards understanding protein interactions. In the last few years, several met...
87
Voted
AE
1999
Springer
15 years 2 months ago
1999
Springer
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality ar...
102
click to vote
CONSTRAINTS
2010
14 years 9 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...