4679 search results - page 372 / 936 » Modeling When Connections Are the Problem |
203
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...
163
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
The Gaussian mixture model (GMM) can approximate arbitrary probability distributions, which makes it a powerful tool for feature representation and classification. However, it su...
166
click to vote
ECML
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. The area under the ROC curve (AUC) has been widely used to measure ranking performance for binary classification tasks. AUC only employs the classifier’s scores to ra...
193
click to vote
ASPDAC
2006
ACM
16 years 21 days ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
199
click to vote
NLPRS
2001
Springer
15 years 11 months ago
2001
Springer
There are two different approaches in the LR parsing. The first one is the deterministic approach that performs the only one action using the control rules learned without any LR ...