3875 search results - page 187 / 775 » Approximation algorithms for the 0-extension problem |
147
Voted
HICSS
2008
IEEE
15 years 11 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
132
Voted
INFORMS
2008
15 years 5 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
143
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
146
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
147
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...