Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
We present a novel algorithm for the markerless tracking of deforming surfaces such as faces. We acquire a sequence of 3D scans along with color images at 40Hz. The data is then re...
Christian Walder, Martin Breidt, Heinrich H. B&uum...
— A new biped gait generation and optimization method is proposed in the frame of Estimation of Distribution Algorithms (EDAs) with Q-learning method. By formulating the biped ga...