Sciweavers

789 search results - page 98 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 5 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
NIPS
2008
15 years 3 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
ICCV
2009
IEEE
14 years 11 months ago
Real-time visual tracking via Incremental Covariance Tensor Learning
Visual tracking is a challenging problem, as an object may change its appearance due to pose variations, illumination changes, and occlusions. Many algorithms have been proposed t...
Yi Wu, Jian Cheng, Jinqiao Wang, Hanqing Lu
TNN
2010
127views Management» more  TNN 2010»
14 years 8 months ago
RAMOBoost: ranked minority oversampling in boosting
In recent years, learning from imbalanced data has attracted growing attention from both academia and industry due to the explosive growth of applications that use and produce imba...
Sheng Chen, Haibo He, Edwardo A. Garcia
JCC
2006
110views more  JCC 2006»
15 years 1 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs