688 search results - page 82 / 138 » General Partitioning on Random Graphs |
86
Voted
IPMI
2005
Springer
16 years 1 months ago
2005
Springer
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
101
Voted
IBPRIA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper extends and generalizes the Bayesian semisupervised segmentation algorithm [1] for oil spill detection using SAR images. In the base algorithm on which we buil...
115
click to vote
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
CACM
2008
15 years 19 days ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
94
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...