Sciweavers

333 search results - page 32 / 67
» A Functional Approach to External Graph Algorithms
Sort
View
BMCBI
2008
137views more  BMCBI 2008»
13 years 7 months ago
VennMaster: Area-proportional Euler diagrams for functional GO analysis of microarrays
Background: Microarray experiments generate vast amounts of data. The functional context of differentially expressed genes can be assessed by querying the Gene Ontology (GO) datab...
Hans A. Kestler, André Müller, Johann ...
SIAMDM
2008
139views more  SIAMDM 2008»
13 years 7 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd
BIRTHDAY
2010
Springer
13 years 8 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
CVPR
2003
IEEE
14 years 9 months ago
Object Segmentation Using Graph Cuts Based Active Contours
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation problems. Our method is a combination of active contours and the optimization t...
Ning Xu, Ravi Bansal, Narendra Ahuja
MICCAI
2000
Springer
13 years 11 months ago
Interactive Organ Segmentation Using Graph Cuts
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
Yuri Boykov, Marie-Pierre Jolly