4843 search results - page 189 / 969 » The Shortcut Problem - Complexity and Approximation |
127
click to vote
UAI
2003
15 years 4 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
130
Voted
DISOPT
2008
15 years 3 months ago
2008
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
118
click to vote
IEICET
2008
15 years 3 months ago
2008
Obtaining the best linear unbiased estimator (BLUE) of noisy signals is a traditional but powerful approach to noise reduction. Explicitly computing the BLUE usually requires the ...
110
click to vote
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
147
Voted
CIARP
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...