Sciweavers

269 search results - page 10 / 54
» Computing the inverse sort transform in linear time
Sort
View
CPM
2009
Springer
131views Combinatorics» more  CPM 2009»
13 years 10 months ago
Linear Time Suffix Array Construction Using D-Critical Substrings
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
Ge Nong, Sen Zhang, Wai Hong Chan
JCP
2007
115views more  JCP 2007»
13 years 7 months ago
Toward The Use Of The Time-Warping Principle With Discrete-Time Sequences
Abstract—This paper establishes a new coherent framework to extend the class of unitary warping operators to the case of discrete–time sequences. Providing some a priori consid...
Arnaud Jarrot, Cornel Ioana, André Quinquis
ICRA
2007
IEEE
143views Robotics» more  ICRA 2007»
14 years 1 months ago
Inverse Depth to Depth Conversion for Monocular SLAM
— Recently it has been shown that an inverse depth parametrization can improve the performance of real-time monocular EKF SLAM, permitting undelayed initialization of features at...
Javier Civera, Andrew J. Davison, J. M. M. Montiel
DAM
2007
105views more  DAM 2007»
13 years 7 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
COCOON
2005
Springer
14 years 28 days ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier