Sciweavers

866 search results - page 15 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
PPAM
2007
Springer
14 years 3 months ago
Application of Fusion-Fission to the Multi-way Graph Partitioning Problem
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized c...
Charles-Edmond Bichot
BMCBI
2005
147views more  BMCBI 2005»
13 years 9 months ago
GATA: a graphic alignment tool for comparative sequence analysis
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
David A. Nix, Michael B. Eisen
CVPR
2012
IEEE
11 years 11 months ago
Segmentation using superpixels: A bipartite graph partitioning approach
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
Zhenguo Li, Xiao-Ming Wu, Shih-Fu Chang
CCCG
2008
13 years 10 months ago
A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
Yurai Núñez Rodríguez, Henry ...
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 9 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis