4131 search results - page 127 / 827 » The Generalized Max-Controlled Set Problem |
129
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
This paper addresses the problem of classifying observations when features are context-sensitive, especially when the testing set involves a context that is different from the tra...
236
Voted
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
163
click to vote
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
118
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
162
click to vote
FSTTCS
2003
Springer
15 years 8 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...