Sciweavers

6095 search results - page 346 / 1219
» Learning in Local Search
Sort
View
ML
2008
ACM
156views Machine Learning» more  ML 2008»
15 years 6 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani
202
Voted
JMLR
2008
151views more  JMLR 2008»
15 years 6 months ago
Learning to Combine Motor Primitives Via Greedy Additive Regression
The computational complexities arising in motor control can be ameliorated through the use of a library of motor synergies. We present a new model, referred to as the Greedy Addit...
Manu Chhabra, Robert A. Jacobs
ECCV
2008
Springer
16 years 8 months ago
Hierarchical Support Vector Random Fields: Joint Training to Combine Local and Global Features
Abstract. Recently, impressive results have been reported for the detection of objects in challenging real-world scenes. Interestingly however, the underlying models vary greatly e...
Paul Schnitzspan, Mario Fritz, Bernt Schiele
CVPR
2007
IEEE
16 years 8 months ago
Filtered Component Analysis to Increase Robustness to Local Minima in Appearance Models
Appearance Models (AM) are commonly used to model appearance and shape variation of objects in images. In particular, they have proven useful to detection, tracking, and synthesis...
Fernando De la Torre, Alvaro Collet, Manuel Quero,...
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
16 years 23 days ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung