450 search results - page 16 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
ECAI
2010
Springer
14 years 9 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
86
Voted
JAIR
2010
14 years 10 months ago
2010
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
107
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
NIPS
2008
15 years 1 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...