725 search results - page 49 / 145 » Smoothed Analysis of Algorithms and Heuristics |
118
click to vote
CAIP
2011
Springer
13 years 10 months ago
2011
Springer
Abstract. In depth map generation, the settings of the algorithm parameters to yield an accurate disparity estimation are usually chosen empirically or based on unplanned experimen...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
108
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
100
click to vote
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
CSB
2003
IEEE
15 years 3 months ago
2003
IEEE
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...