Sciweavers

271 search results - page 14 / 55
» Graph limits and parameter testing
Sort
View
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
14 years 3 months ago
Dense and Switched Modular Primitives for Bond Graph Model Design
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
Kisung Seo, Zhun Fan, Jianjun Hu, Erik D. Goodman,...
ANTSW
2004
Springer
14 years 3 months ago
Ants Can Play Music
In this paper, we describe how we can generate music by simulating moves of artificial ants on a graph where vertices represent notes and edges represent possible transitions betw...
Christophe Guéret, Nicolas Monmarché...
ECCC
2011
205views ECommerce» more  ECCC 2011»
13 years 4 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner
CVPR
2009
IEEE
15 years 5 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
MICCAI
2006
Springer
14 years 10 months ago
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
Ali Kemal Sinop, Leo Grady