3875 search results - page 369 / 775 » Approximation algorithms for the 0-extension problem |
205
click to vote
JMLR
2008
15 years 6 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
179
click to vote
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
166
click to vote
NIPS
2007
15 years 8 months ago
2007
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
152
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
In this paper, the problem of non-regular static state feedback linearization of a ne nonlinear systems is considered. First of all, a new canonical form for non-regular feedback ...
174
click to vote
SIAMJO
2008
15 years 6 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...