Sciweavers

301 search results - page 34 / 61
» Non-linear estimation is easy
Sort
View
PAMI
2007
102views more  PAMI 2007»
14 years 10 months ago
Feature Subset Selection and Ranking for Data Dimensionality Reduction
—A new unsupervised forward orthogonal search (FOS) algorithm is introduced for feature selection and ranking. In the new algorithm, features are selected in a stepwise way, one ...
Hua-Liang Wei, Stephen A. Billings
ICST
2010
IEEE
14 years 9 months ago
Generating Transition Probabilities for Automatic Model-Based Test Generation
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
Abderrahmane Feliachi, Hélène Le Gue...
ACCV
2010
Springer
14 years 6 months ago
An Efficient RANSAC for 3D Object Recognition in Noisy and Occluded Scenes
In this paper, we present an efficient algorithm for 3D object recognition in presence of clutter and occlusions in noisy, sparse and unsegmented range data. The method uses a robu...
Chavdar Papazov, Darius Burschka
COLING
2010
14 years 6 months ago
Tree Topological Features for Unlexicalized Parsing
As unlexicalized parsing lacks word token information, it is important to investigate novel parsing features to improve the accuracy. This paper studies a set of tree topological ...
Samuel W. K. Chan, Lawrence Y. L. Cheung, Mickey W...
IOR
2011
107views more  IOR 2011»
14 years 6 months ago
Information Collection on a Graph
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
Ilya O. Ryzhov, Warren B. Powell