Sciweavers

2125 search results - page 9 / 425
» On Graph Complexity
Sort
View
CVPR
2004
IEEE
13 years 11 months ago
Modeling Complex Motion by Tracking and Editing Hidden Markov Graphs
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
Yizhou Wang, Song Chun Zhu
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 26 days ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 1 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
14 years 1 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
AI
2002
Springer
13 years 7 months ago
Emergence of social conventions in complex networks
The emergence of social conventions in multi-agent systems has been analyzed mainly in settings where every agent may interact either with every other agent or with nearest neighb...
Jordi Delgado