3875 search results - page 307 / 775 » Approximation algorithms for the 0-extension problem |
178
click to vote
TNN
2010
15 years 1 months ago
2010
Abstract--In this paper we investigate the sparsity and recognition capabilities of two approximate Bayesian classification algorithms, the multi-class multi-kernel Relevance Vecto...
188
click to vote
AAAI
2012
13 years 9 months ago
2012
Many signals of interest are corrupted by faults of an unknown type. We propose an approach that uses Gaussian processes and a general “fault bucket” to capture a priori uncha...
178
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...
181
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
165
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...