4894 search results - page 326 / 979 » The Guarding Problem - Complexity and Approximation |
145
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
179
click to vote
ECCV
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Assessing the matching error rates of a biometric identification devices is integral to understanding its performance. Here we propose and evaluate several methods for cr...
229
click to vote
TSMC
2010
15 years 1 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
154
click to vote
ISAAC
2005
Springer
16 years 6 days ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
236
click to vote
FAW
2010
Springer
15 years 6 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...