831 search results - page 25 / 167 » Finding Minimum Data Requirements Using Pseudo-independence |
MICCAI
2009
Springer
14 years 7 months ago
2009
Springer
Automated segmentation of the esophagus in CT images is of high value to radiologists for oncological examinations of the mediastinum. It can serve as a guideline and prevent confu...
ICCV
1999
IEEE
14 years 12 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
APPROX
2008
Springer
14 years 2 days ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
ECCV
2006
Springer
14 years 12 months ago
2006
Springer
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...
KDD
2006
ACM
14 years 10 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...