Sciweavers

866 search results - page 20 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
LION
2009
Springer
112views Optimization» more  LION 2009»
14 years 3 months ago
A Graph-Based Semi-supervised Algorithm for Protein Function Prediction from Interaction Maps
Abstract. Protein function prediction represents a fundamental challenge in bioinformatics. The increasing availability of proteomics network data has enabled the development of se...
Valerio Freschi
CVPR
2009
IEEE
15 years 4 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...
DSD
2003
IEEE
100views Hardware» more  DSD 2003»
14 years 2 months ago
Fast Heuristics for the Edge Coloring of Large Graphs
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
Mario Hilgemeier, Nicole Drechsler, Rolf Drechsler
CCGRID
2006
IEEE
14 years 3 months ago
Nexus: A Novel Weighted-Graph-Based Prefetching Algorithm for Metadata Servers in Petabyte-Scale Storage Systems
Abstract— An efficient, accurate and distributed metadataoriented prefetching scheme is critical to the overall performance in large distributed storage systems. In this paper, ...
Peng Gu, Yifeng Zhu, Hong Jiang, Jun Wang
FSTTCS
2009
Springer
14 years 3 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...