2714 search results - page 182 / 543 » Approximation Schemes for Scheduling |
147
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
Stationarity is often an unrealistic prior assumption for Gaussian process regression. One solution is to predefine an explicit nonstationary covariance function, but such covaria...
231
click to vote
SIAMCOMP
2011
14 years 6 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
125
click to vote
AAAI
2012
13 years 6 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
183
click to vote
GM
1999
Springer
15 years 8 months ago
1999
Springer
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...
154
click to vote
TNN
2008
15 years 3 months ago
2008
Abstract--Suppose for a given classification or function approximation (FA) problem data are collected using sensors. From the output of the th sensor, features are extracted, ther...