Sciweavers

829 search results - page 23 / 166
» Distance domination-critical graphs
Sort
View
78
Voted
ECCC
2008
93views more  ECCC 2008»
14 years 9 months ago
A Note on the Distance to Monotonicity of Boolean Functions
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
Arnab Bhattacharyya
SPIRE
2005
Springer
15 years 3 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
ICIP
2010
IEEE
14 years 7 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...
ICPR
2010
IEEE
14 years 7 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. ...
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
15 years 1 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...