Sciweavers

4926 search results - page 253 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
FUIN
2007
95views more  FUIN 2007»
15 years 6 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
16 years 7 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 6 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
ICPR
2008
IEEE
16 years 7 months ago
Detection of anatomical landmarks in human colon from computed tomographic colonography images
Colon cancer is the second leading cause of cancer-related deaths per year in industrial nations. Virtual colonoscopy is a new, less invasive alternative to the usually practiced ...
Ananda S. Chowdhury, Jianhua Yao, Marius George Li...
ICIP
2002
IEEE
16 years 8 months ago
Object contour tracking using graph cuts based active contours
In this paper, we present an object contour tracking approach using graph cuts based active contours (GCBAC). Our proposed algorithm does not need any a priori global shape model,...
Ning Xu, Narendra Ahuja