Sciweavers

1736 search results - page 158 / 348
» The rank-width of Directed Graphs
Sort
View
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 8 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
MCS
2010
Springer
15 years 6 months ago
Selecting Structural Base Classifiers for Graph-Based Multiple Classifier Systems
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
Wan-Jui Lee, Robert P. W. Duin, Horst Bunke
ICCAD
2001
IEEE
101views Hardware» more  ICCAD 2001»
16 years 1 months ago
Instruction Generation for Hybrid Reconfigurable Systems
In this work, we present an algorithm for simultaneous template generation and matching. The algorithm profiles the graph and iteratively contracts edges to create the templates. ...
Ryan Kastner, Seda Ogrenci Memik, Elaheh Bozorgzad...
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
15 years 10 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
SMI
2006
IEEE
121views Image Analysis» more  SMI 2006»
15 years 10 months ago
Minimum Ratio Contours on Surface Meshes
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
Andrew Clements, Hao Zhang 0002