1201 search results - page 114 / 241 » Linear Probing and Graphs |
88
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
109
click to vote
CIBCB
2006
IEEE
15 years 6 months ago
2006
IEEE
— Successful biological image analysis usually requires satisfactory segmentations to identify regions of interest as an intermediate step. Here we present a novel graphical mode...
153
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
137
click to vote
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
197
Voted
ISVC
2009
Springer
15 years 5 months ago
2009
Springer
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs). In this paper, we present a novel and fast 3D segment...