560 search results - page 76 / 112 » Level-set methods for convex optimization |
118
click to vote
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
A serious drawback of kernel methods, and Support Vector Machines (SVM) in particular, is the difficulty in choosing a suitable kernel function for a given dataset. One of the appr...
160
click to vote
CVPR
1998
IEEE
16 years 5 months ago
1998
IEEE
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...
139
click to vote
RECOMB
2009
Springer
16 years 3 months ago
2009
Springer
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
102
Voted
NIPS
2007
15 years 4 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
153
click to vote
PAMI
2008
15 years 3 months ago
2008
Conventional photometric stereo recovers one normal direction per pixel of the input image. This fundamentally limits the scale of recovered geometry to the resolution of the input...