Sciweavers

1158 search results - page 144 / 232
» Template Generation and Selection Algorithms
Sort
View
141
Voted
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 11 months ago
Using Multi-hypothesis Mapping to close Loops in Complex Cyclic Environments
— This paper describes an off-line, iterative algorithm for simultaneous localization and mapping within large indoor environments. The proposed approach is based on the idea of ...
Haris Baltzakis, Panos E. Trahanias
EVOW
2010
Springer
15 years 9 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
FPL
2008
Springer
207views Hardware» more  FPL 2008»
15 years 6 months ago
Bitstream compression techniques for Virtex 4 FPGAs
This paper examines the opportunity of using compression for accelerating the (re)configuration of FPGA devices, focusing on the choice of compression algorithms, and their hardwa...
Radu Stefan, Sorin Dan Cotofana
SDM
2007
SIAM
147views Data Mining» more  SDM 2007»
15 years 6 months ago
Constraint-Based Pattern Set Mining
Local pattern mining algorithms generate sets of patterns, which are typically not directly useful and have to be further processed before actual application or interpretation. Ra...
Luc De Raedt, Albrecht Zimmermann
115
Voted
CSDA
2006
91views more  CSDA 2006»
15 years 5 months ago
Maximum a posteriori pruning on decision trees and its application to bootstrap BUMPing
The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the o...
Jinseog Kim, Yongdai Kim