Sciweavers

3702 search results - page 380 / 741
» All Pairings Are in a Group
Sort
View
COLT
2005
Springer
16 years 12 days ago
Generalization Error Bounds Using Unlabeled Data
We present two new methods for obtaining generalization error bounds in a semi-supervised setting. Both methods are based on approximating the disagreement probability of pairs of ...
Matti Kääriäinen
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
16 years 12 days ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
GFKL
2005
Springer
105views Data Mining» more  GFKL 2005»
16 years 12 days ago
Variable Selection for Discrimination of More Than Two Classes Where Data are Sparse
In classification, with an increasing number of variables, the required number of observations grows drastically. In this paper we present an approach to put into effect the maxi...
Gero Szepannek, Claus Weihs
ICNC
2005
Springer
16 years 12 days ago
DNA Computing Approach to Construction of Semantic Model
In this paper, after a new DNA-based semantic model is theoretically proposed, the preliminary experiment on construction of the small test model is successfully done. This model, ...
Yusei Tsuboi, Zuwairie Ibrahim, Nobuyuki Kasai, Os...
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
16 years 11 days ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen