3894 search results - page 142 / 779 » Approximation Algorithms for Biclustering Problems |
184
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
145
click to vote
SIAMCO
2000
15 years 6 months ago
2000
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
146
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
162
click to vote
JACM
1998
15 years 6 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
185
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...