Sciweavers

193 search results - page 28 / 39
» Fast searches for effective optimization phase sequences
Sort
View
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
15 years 7 months ago
Study Diploid System by a Hamiltonian Cycle Problem Algorithm
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
Dong Xianghui, Ruwei Dai
110
Voted
ML
2006
ACM
142views Machine Learning» more  ML 2006»
15 years 1 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....
CW
2002
IEEE
15 years 6 months ago
Direct Segmentation for Reverse Engineering
In Reverse Engineering a physical object is digitally reconstructed from a set of boundary points. In the segmentation phase these points are grouped into subsets to facilitate co...
Marek Vanco, Guido Brunnett
122
Voted
JVCIR
2006
126views more  JVCIR 2006»
15 years 1 months ago
Efficient intra- and inter-mode selection algorithms for H.264/ AVC
Intra-frame mode selection and inter-frame mode selection are new features introduced in the H.264 standard. Intra-frame mode selection dramatically reduces spatial redundancy in ...
Andy C. Yu, King Ngi Ngan, Graham R. Martin
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
15 years 8 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002