Sciweavers

253 search results - page 18 / 51
» Faster Approximation of Distances in Graphs
Sort
View
173
Voted
ICIP
2010
IEEE
15 years 1 months ago
3D vertebrae segmentation using graph cuts with shape prior constraints
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...
Melih S. Aslan, Asem M. Ali, Dongqing Chen, Ben Ar...
153
Voted
ICPR
2010
IEEE
15 years 1 months ago
3D Vertebral Body Segmentation Using Shape Based Graph Cuts
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...
Melih S. Aslan, Asem M. Ali, Aly A. Farag, Ham M. ...
145
Voted
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 4 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
116
Voted
JDA
2007
97views more  JDA 2007»
15 years 3 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
114
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Sensor Network Localization Using Sensor Perturbation
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
Yuanchen Zhu, Steven J. Gortler, Dylan Thurston