Sciweavers

1722 search results - page 68 / 345
» On the sample mean of graphs
Sort
View
SAC
2009
ACM
15 years 5 months ago
A gradient oriented recombination scheme for evolution strategies
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
Haifeng Chen, Guofei Jiang
GD
2005
Springer
15 years 3 months ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong
CVPR
2004
IEEE
15 years 1 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
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
14 years 11 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
97
Voted
PVLDB
2010
152views more  PVLDB 2010»
14 years 8 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...