Sciweavers

1756 search results - page 103 / 352
» Directed scale-free graphs
Sort
View
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 5 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
MICCAI
2010
Springer
13 years 6 months ago
Morphology-Guided Graph Search for Untangling Objects: C. elegans Analysis
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
Tammy Riklin Raviv, Vebjorn Ljosa, Annie L. Conery...
PAMI
2010
260views more  PAMI 2010»
13 years 6 months ago
Unsupervised Object Segmentation with a Hybrid Graph Model (HGM)
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
Guangcan Liu, Zhouchen Lin, Yong Yu, Xiaoou Tang
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 3 months ago
Human-Assisted Graph Search: It's Okay to Ask Questions
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...
EDBTW
2010
Springer
14 years 2 months ago
Biochemical network matching and composition
Graph composition has applications in a variety of practical applications. In drug development, for instance, in order to understand possible drug interactions, one has to merge k...
Martin Hugh Goodfellow, John Wilson, Ela Hunt