Sciweavers

434 search results - page 66 / 87
» Constraint-Based Combinators for Local Search
Sort
View
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
13 years 8 months ago
Learning Markov Network Structure with Decision Trees
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...
Daniel Lowd, Jesse Davis
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 10 months ago
A divide-and-merge methodology for clustering
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...
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 10 months ago
A novel spectral coding in a large graph database
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
DAGM
2009
Springer
14 years 4 months ago
Markerless 3D Face Tracking
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...
IROS
2006
IEEE
144views Robotics» more  IROS 2006»
14 years 4 months ago
Estimating Probability Distribution with Q-learning for Biped Gait Generation and Optimization
— 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...
Lingyun Hu, Changjiu Zhou, Zengqi Sun