3894 search results - page 157 / 779 » Approximation Algorithms for Biclustering Problems |
174
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
184
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
187
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
211
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
179
click to vote
AAECC
2006
Springer
15 years 6 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...