Sciweavers

2723 search results - page 430 / 545
» Learning lexicographic orders
Sort
View
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
15 years 6 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen
ICB
2009
Springer
412views Biometrics» more  ICB 2009»
15 years 6 months ago
Bayesian Face Recognition Based on Markov Random Field Modeling
In this paper, a Bayesian method for face recognition is proposed based on Markov Random Fields (MRF) modeling. Constraints on image features as well as contextual relationships be...
Rui Wang, Zhen Lei, Meng Ao, Stan Z. Li
MHCI
2009
Springer
15 years 6 months ago
Please touch the exhibits!: using NFC-based interaction for exploring a museum
Museums often use mobile devices and applications to let visitors explore their exhibits and interact with them in order to make the user experience more immersive and enjoyable. ...
Magdalena Blöckner, Svetlana Danti, Jennifer ...
NOSSDAV
2009
Springer
15 years 6 months ago
SLIPstream: scalable low-latency interactive perception on streaming data
A critical problem in implementing interactive perception applications is the considerable computational cost of current computer vision and machine learning algorithms, which typ...
Padmanabhan Pillai, Lily B. Mummert, Steven W. Sch...
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
15 years 6 months ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain