14161 search results - page 349 / 2833 » On generalized middle-level problem |
216
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
194
click to vote
AUTOMATICA
1999
15 years 6 months ago
1999
We formulate the L2-gain control problem for a general nonlinear, state-space system with projection dynamics in the state evolution and hard constraints on the set of admissible ...
184
click to vote
JMLR
2010
15 years 5 months ago
2010
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
169
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
165
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems. In terms of the associated optimization problem, computing linear eigenvectors a...