Sciweavers

310 search results - page 16 / 62
» Cutting two graphs simultaneously
Sort
View
COLING
2010
13 years 4 months ago
Towards a Unified Approach to Simultaneous Single-Document and Multi-Document Summarizations
Single-document summarization and multidocument summarization are very closely related tasks and they have been widely investigated independently. This paper examines the mutual i...
Xiaojun Wan
MICCAI
2008
Springer
14 years 10 months ago
A Discriminative Model-Constrained Graph Cuts Approach to Fully Automated Pediatric Brain Tumor Segmentation in 3-D MRI
In this paper we present a fully automated approach to the segmentation of pediatric brain tumors in multi-spectral 3-D magnetic resonance images. It is a top-down segmentation app...
Michael Wels, Gustavo Carneiro, Alexander Aplas,...
ICCV
1999
IEEE
14 years 11 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Multicriteria Global Minimum Cuts
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
Amitai Armon, Uri Zwick
FOCS
1994
IEEE
14 years 1 months ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Michael A. Bender, Donna K. Slonim