Sciweavers

557 search results - page 51 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
TAMC
2009
Springer
15 years 5 months ago
Approximation and Hardness Results for Label Cut and Related Problems
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 3 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
94
Voted
SMI
2010
IEEE
120views Image Analysis» more  SMI 2010»
14 years 9 months ago
Single-Cycle Plain-Woven Objects
—It has recently been shown that if we twist an arbitrary subset of edges of a mesh on an orientable surface, the resulting extended graph rotation system (EGRS) can be used to i...
Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L....
CVPR
2010
IEEE
15 years 7 months ago
Geodesic Graph Cut for Interactive Image Segmentation
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
Brian Price, Bryan Morse, Scott Cohen
IVC
2007
89views more  IVC 2007»
14 years 11 months ago
Sequential Monte Carlo tracking by fusing multiple cues in video sequences
This paper presents visual cues for object tracking in video sequences using particle filtering. A consistent histogram-based framework is developed for the analysis of colour, e...
Paul Brasnett, Lyudmila Mihaylova, David R. Bull, ...