Sciweavers

223 search results - page 28 / 45
» A Note on Graph Pebbling
Sort
View
TCS
2008
13 years 7 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy
ICPR
2008
IEEE
14 years 2 months ago
Application of graph coloring in physical layout segmentation
Every-day, the postal sorting systems diffuse several tons of mails. It is noted that the principal origin of mail rejection is related to the failure of address-block localizatio...
Djamel Gaceb, Véronique Eglin, Frank Lebour...
AAIM
2007
Springer
188views Algorithms» more  AAIM 2007»
14 years 1 months ago
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirot...
ACCV
2010
Springer
13 years 2 months ago
A Convex Image Segmentation: Extending Graph Cuts and Closed-Form Matting
Abstract. Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimiz...
Youngjin Park, Suk I. Yoo
ICASSP
2011
IEEE
12 years 11 months ago
Semi-automatic 2D to 3D image conversion using a hybrid Random Walks and graph cuts based approach
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...
Raymond Phan, Richard Rzeszutek, Dimitrios Androut...