4131 search results - page 223 / 827 » The Generalized Max-Controlled Set Problem |
140
click to vote
NIPS
2008
15 years 5 months ago
2008
In analogy to the PCA setting, the sparse PCA problem is often solved by iteratively alternating between two subtasks: cardinality-constrained rank-one variance maximization and m...
134
click to vote
JAIR
2008
15 years 3 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
132
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
160
click to vote
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
147
click to vote
PETRA
2009
ACM
15 years 10 months ago
2009
ACM
Given a 3D environment, a set of constraints, and a set of sensor models, this paper addresses the problem of finding the set of sensors and their corresponding placement that cov...