1542 search results - page 95 / 309 » The metamathematics of random graphs |
100
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
139
click to vote
MICCAI
2010
Springer
15 years 5 days ago
2010
Springer
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
108
Voted
SIAMCOMP
2010
15 years 4 days ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
151
click to vote
ICIP
2010
IEEE
14 years 11 months ago
2010
IEEE
Osteoporosis is a bone disease characterized by a reduction in bone mass, resulting in an increased risk of fractures. To diagnose the osteoporosis accurately, bone mineral densit...
136
click to vote
ICPR
2010
IEEE
14 years 11 months ago
2010
IEEE
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs). In this paper, we propose a novel 3D shape based met...