Sciweavers

1133 search results - page 89 / 227
» Basics of Graph Cuts
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 10 months ago
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
Paul Christiano, Jonathan A. Kelner, Aleksander Ma...
COCOON
2007
Springer
15 years 4 months ago
On the Hardness of Optimization in Power Law Graphs
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
Alessandro Ferrante, Gopal Pandurangan, Kihong Par...
TPCTC
2010
Springer
149views Hardware» more  TPCTC 2010»
14 years 7 months ago
A Discussion on the Design of Graph Database Benchmarks
Graph Database Management systems (GDBs) are gaining popularity. They are used to analyze huge graph datasets that are naturally appearing in many application areas to model interr...
David Dominguez-Sal, Norbert Martínez-Bazan...
SMI
2006
IEEE
121views Image Analysis» more  SMI 2006»
15 years 3 months ago
Minimum Ratio Contours on Surface Meshes
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
Andrew Clements, Hao Zhang 0002
EVOW
2005
Springer
15 years 3 months ago
Region Merging for Severe Oversegmented Images Using a Hierarchical Social Metaheuristic
This paper proposes a new evolutionary region merging method to improve segmentation quality result on oversegmented images. The initial segmented image is described by a modified ...
Abraham Duarte, Ángel Sánchez, Felip...