Sciweavers

393 search results - page 31 / 79
» On the Convergence of Boosting Procedures
Sort
View
TABLEAUX
1999
Springer
14 years 26 days ago
Tableau Calculi for Hybrid Logics
Hybrid logics were proposed in 15 as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as...
Miroslava Tzakova
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 8 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
COLING
2010
13 years 3 months ago
Effective Constituent Projection across Languages
We describe an effective constituent projection strategy, where constituent projection is performed on the basis of dependency projection. Especially, a novel measurement is propo...
Wenbin Jiang, Yajuan Lv, Yang Liu, Qun Liu
IJCNN
2006
IEEE
14 years 2 months ago
A Columnar Competitive Model with Simulated Annealing for Solving Combinatorial Optimization Problems
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
Eu Jin Teoh, Huajin Tang, Kay Chen Tan
ICRA
2005
IEEE
126views Robotics» more  ICRA 2005»
14 years 2 months ago
Global A-Optimal Robot Exploration in SLAM
— It is well-known that the Kalman filter for simultaneous localization and mapping (SLAM) converges to a fully correlated map in the limit of infinite time and data [1]. Howev...
Robert Sim, Nicholas Roy