4894 search results - page 666 / 979 » The Guarding Problem - Complexity and Approximation |
122
Voted
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
120
Voted
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
103
Voted
ISBI
2008
IEEE
16 years 4 months ago
2008
IEEE
In functional Magnetic Resonance Imaging group studies, uncertainties on the individual BOLD responses are not taken into account by standard detection procedures, which may limit...
146
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
122
click to vote
CAV
2009
Springer
16 years 4 months ago
2009
Springer
We address the problem of analyzing programs such as J2ME midlets for mobile devices, where a central correctness requirement concerns confidentiality of data that the user wants t...