Sciweavers

2609 search results - page 348 / 522
» Optimizing for parallelism and data locality
Sort
View
ICPR
2006
IEEE
16 years 6 months ago
Affine Invariant Dynamic Time Warping and its Application to Online Rotated Handwriting Recognition
Dynamic Time Warping (DTW) has been widely used to align and compare two sequences. DTW can efficiently deal with local warp or deformation between sequences. However, it can'...
Yu Qiao, Makoto Yasuhara
139
Voted
3DIM
2007
IEEE
15 years 11 months ago
Outlier Robust ICP for Minimizing Fractional RMSD
We describe a variation of the iterative closest point (ICP) algorithm for aligning two point sets under a set of transformations. Our algorithm is superior to previous algorithms...
Jeff M. Phillips, Ran Liu, Carlo Tomasi
INFOCOM
2007
IEEE
15 years 11 months ago
Cost and Collision Minimizing Forwarding Schemes for Wireless Sensor Networks
—The paper presents a novel integrated MAC/routing scheme for wireless sensor networking. Our design objective is to elect the next hop for data forwarding by minimizing the numb...
Michele Rossi, Nicola Bui, Michele Zorzi
IROS
2007
IEEE
159views Robotics» more  IROS 2007»
15 years 11 months ago
Approximate covariance estimation in graphical approaches to SLAM
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
Gian Diego Tipaldi, Giorgio Grisetti, Wolfram Burg...
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
15 years 11 months ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles