1941 search results - page 86 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
SIAMCOMP
2010
14 years 4 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
ICAISC
2004
Springer
15 years 3 months ago
2004
Springer
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...
103
click to vote
NN
2002
Springer
2002
Springer
Optimal design of regularization term and regularization parameter by subspace information criterion
14 years 9 months ago
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
WWW
2010
ACM
15 years 3 months ago
2010
ACM
This paper addresses the problem of identifying redundant data in large-scale service-oriented information systems. Specifically, the paper puts forward an automated method to pi...