Sciweavers

296 search results - page 15 / 60
» Approximation Algorithms for Requirement Cut on Graphs
Sort
View
FOCM
2007
76views more  FOCM 2007»
14 years 9 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale
ICASSP
2011
IEEE
14 years 1 months ago
Semi-automatic 2D to 3D image conversion using a hybrid Random Walks and graph cuts based approach
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...
Raymond Phan, Richard Rzeszutek, Dimitrios Androut...
77
Voted
ICML
2008
IEEE
15 years 10 months ago
Optimized cutting plane algorithm for support vector machines
We have developed a new Linear Support Vector Machine (SVM) training algorithm called OCAS. Its computational effort scales linearly with the sample size. In an extensive empirica...
Sören Sonnenburg, Vojtech Franc
96
Voted
ISBI
2011
IEEE
14 years 1 months ago
Automatic segmentation of the left-ventricular cavity and atrium in 3D ultrasound using graph cuts and the radial symmetry trans
In this paper, we propose a graph-based method for fullyautomatic segmentation of the left ventricle and atrium in 3D ultrasound (3DUS) volumes. Our method requires no user input ...
Radford Juang, Elliot R. McVeigh, Beatrice Hoffman...
84
Voted
STACS
2005
Springer
15 years 3 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney