Sciweavers

3068 search results - page 97 / 614
» Clustering with Multiple Graphs
Sort
View
SPE
2008
91views more  SPE 2008»
15 years 15 days ago
A multiple layer model to compare RNA secondary structures
composed of various graphs linked together by relations of abstraction/refinement. The new structure is useful for representing information that can be described at t levels of abs...
Julien Allali, Marie-France Sagot
85
Voted
ISCAPDCS
2007
15 years 2 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
APPROX
2010
Springer
220views Algorithms» more  APPROX 2010»
15 years 2 months ago
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri...
89
Voted
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 21 days ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
78
Voted
CCGRID
2006
IEEE
15 years 6 months ago
Transparent Adaptive Library-Based Checkpointing for Master-Worker Style Parallelism
We present a transparent, system-level checkpointing solution for master-worker parallelism that automatically adapts, upon restart, to the number of processor nodes available. Th...
Gene Cooperman, Jason Ansel, Xiaoqin Ma