14161 search results - page 196 / 2833 » On generalized middle-level problem |
CSSC
2008
15 years 1 months ago
2008
For the two-sample location problem we consider a general class of tests, all members of it are based on U-statistics. The asymptotic efficicacies are investigated in detail. We c...
EOR
2006
15 years 1 months ago
2006
This paper studies the duality gap in the simple plant location problem, and presents general formulas for the gap when certain complementary slackness conditions are satisfied. W...
MP
2006
15 years 1 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
121
click to vote
SIAMJO
2010
14 years 8 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...