Sciweavers

6740 search results - page 201 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
HIPC
2007
Springer
14 years 4 months ago
Accelerating Large Graph Algorithms on the GPU Using CUDA
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
Pawan Harish, P. J. Narayanan
EMMCVPR
2011
Springer
12 years 10 months ago
SlimCuts: GraphCuts for High Resolution Images Using Graph Reduction
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
Björn Scheuermann, Bodo Rosenhahn
ICIP
2008
IEEE
14 years 5 months ago
Multi-polarity text segmentation using graph theory
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
Jia Li, YongHong Tian, Tiejun Huang, Wen Gao
ISAAC
2005
Springer
131views Algorithms» more  ISAAC 2005»
14 years 4 months ago
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
Xiao Zhou, Takao Nishizeki
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 10 months ago
Stochastic Minority on Graphs
Abstract. Cellular automata have been mainly studied for on very regular graphs carrying the cells (like lines or grids) and under synchronous dynamics (all cells update simultaneo...
Jean-Baptiste Rouquier, Damien Regnault, Eric Thie...