Sciweavers

2440 search results - page 408 / 488
» Abstraction Learning
Sort
View
168
Voted
MCS
2010
Springer
15 years 11 months ago
Online Non-stationary Boosting
Abstract. Oza’s Online Boosting algorithm provides a version of AdaBoost which can be trained in an online way for stationary problems. One perspective is that this enables the p...
Adam Pocock, Paraskevas Yiapanis, Jeremy Singer, M...
188
Voted
STACS
2010
Springer
15 years 11 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
DATE
2010
IEEE
180views Hardware» more  DATE 2010»
15 years 11 months ago
A reconfigurable cache memory with heterogeneous banks
Abstract— The optimal size of a large on-chip cache can be different for different programs: at some point, the reduction of cache misses achieved when increasing cache size hits...
Domingo Benitez, Juan C. Moure, Dolores Rexachs, E...
207
Voted
ECCV
2010
Springer
15 years 11 months ago
Building Compact Local Pairwise Codebook with Joint Feature Space Clustering
Abstract. This paper presents a simple, yet effective method of building a codebook for pairs of spatially close SIFT descriptors. Integrating such codebook into the popular bag-o...
ICRA
2002
IEEE
146views Robotics» more  ICRA 2002»
15 years 11 months ago
Algorithms and Sensors for Small Robot Path Following
Abstract— Tracked mobile robots in the 20 kg size class are under development for applications in urban reconnaissance. For efficient deployment, it is desirable for teams of ro...
Robert W. Hogg, Arturo L. Rankin, Stergios I. Roum...