Sciweavers

4541 search results - page 97 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
CEC
2010
IEEE
15 years 9 days ago
Two novel Ant Colony Optimization approaches for Bayesian network structure learning
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
Yanghui Wu, John A. W. McCall, David W. Corne
ALT
2008
Springer
15 years 8 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
IJCAI
2007
15 years 19 days ago
Incremental Construction of Structured Hidden Markov Models
This paper presents an algorithm for inferring a Structured Hidden Markov Model (S-HMM) from a set of sequences. The S-HMMs are a sub-class of the Hierarchical Hidden Markov Model...
Ugo Galassi, Attilio Giordana, Lorenza Saitta
ECCV
2000
Springer
16 years 1 months ago
A Six Point Solution for Structure and Motion
The paper has two main contributions: The rst is a set of methods for computing structure and motion for m 3 views of 6 points. It is shown that a geometric image error can be mini...
Frederik Schaffalitzky, Andrew Zisserman, Richard ...
IJIT
2004
15 years 18 days ago
Genetic Algorithm for Feature Subset Selection with Exploitation of Feature Correlations from Continuous Wavelet Transform: a re
A genetic algorithm (GA) based feature subset selection algorithm is proposed in which the correlation structure of the features is exploited. The subset of features is validated a...
Gert Van Dijck, Marc M. Van Hulle, M. Wevers