740 search results - page 16 / 148 » An approximation ratio for biclustering |
80
Voted
ALT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We consider the problem of efficient approximate learning by multilayered feedforward circuits subject to two objective functions. First, we consider the objective to ma...
133
click to vote
ICDCS
2008
IEEE
15 years 8 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
140
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
100
click to vote
JDA
2006
15 years 1 months ago
2006
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
159
click to vote
MFCS
2005
Springer
15 years 7 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...