Sciweavers

6365 search results - page 56 / 1273
» Fast Local Computation Algorithms
Sort
View
105
Voted
BMCBI
2008
125views more  BMCBI 2008»
15 years 20 days ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
122
Voted
CIARP
2007
Springer
15 years 2 months ago
Robust Local Localization of a Mobile Robot in Indoor Environments Using Virtual Corners
This paper deals with the problem of finding the movement of a mobile robot given two consecutive laser scans. The proposed method extracts a line map from the sequence of points ...
Carlos Lara, Leonardo Romero
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
15 years 14 days ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber
IVC
2007
164views more  IVC 2007»
15 years 14 days ago
Locality preserving CCA with applications to data visualization and pose estimation
- Canonical correlation analysis (CCA) is a major linear subspace approach to dimensionality reduction and has been applied to image processing, pose estimation and other fields. H...
Tingkai Sun, Songcan Chen
87
Voted
ICRA
2000
IEEE
115views Robotics» more  ICRA 2000»
15 years 5 months ago
Virtual Obstacle Concept for Local-Minimum Recovery in Potential-Field Based Navigation
We present a navigation algorithm, which integrates virtual obstacle concept with a potential-field-based method to maneuver cylindrical mobile robots in unknown or unstructured e...
Liu Chengqing, Marcelo H. Ang, Hariharan Krishnan,...