Sciweavers

2988 search results - page 28 / 598
» Experiments with a New Boosting Algorithm
Sort
View
CP
2005
Springer
15 years 3 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
PR
2006
108views more  PR 2006»
14 years 9 months ago
Boosted discriminant projections for nearest neighbor classification
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
David Masip, Jordi Vitrià
79
Voted
JMLR
2010
161views more  JMLR 2010»
14 years 4 months ago
Empirical Bernstein Boosting
Concentration inequalities that incorporate variance information (such as Bernstein's or Bennett's inequality) are often significantly tighter than counterparts (such as...
Pannagadatta K. Shivaswamy, Tony Jebara
82
Voted
CP
2006
Springer
15 years 1 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
102
Voted
3DIM
2007
IEEE
15 years 1 months ago
Aerial Lidar Data Classification using AdaBoost
We use the AdaBoost algorithm to classify 3D aerial lidar scattered height data into four categories: road, grass, buildings, and trees. To do so we use five features: height, hei...
Suresh K. Lodha, Darren N. Fitzpatrick, David P. H...