Sciweavers

2219 search results - page 190 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ICALP
2007
Springer
15 years 9 months ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber
MM
2010
ACM
174views Multimedia» more  MM 2010»
15 years 3 months ago
Image classification using the web graph
Image classification is a well-studied and hard problem in computer vision. We extend a proven solution for classifying web spam to handle images. We exploit the link structure of...
Dhruv Kumar Mahajan, Malcolm Slaney
CVPR
2010
IEEE
15 years 11 months ago
A Diffusion Approach to Seeded Image Segmentation
Seeded image segmentation is a popular type of supervised image segmentation in computer vision and image processing. Previous methods of seeded image segmentation treat the image...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
GD
1998
Springer
15 years 7 months ago
Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
BMCBI
2011
14 years 10 months ago
Hierarchical graphs for rule-based modeling of biochemical systems
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
Nathan W. Lemons, Bin Hu, William S. Hlavacek