Sciweavers

619 search results - page 104 / 124
» Random Bichromatic Matchings
Sort
View
ICIP
2010
IEEE
13 years 6 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
13 years 6 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. ...
ACL
2011
13 years 11 days ago
Effective Measures of Domain Similarity for Parsing
It is well known that parsing accuracy suffers when a model is applied to out-of-domain data. It is also known that the most beneficial data to parse a given domain is data that ...
Barbara Plank, Gertjan van Noord
ICALP
2009
Springer
14 years 9 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 3 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen