Sciweavers

221 search results - page 2 / 45
» A linear-time algorithm for Euclidean feature transform sets
Sort
View
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 6 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
ICRA
2003
IEEE
116views Robotics» more  ICRA 2003»
13 years 10 months ago
Linear time vehicle relocation in SLAM
Abstract— In this paper we propose an algorithm to determine the location of a vehicle in an environment represented by a stochastic map, given a set of environment measurements ...
José Neira, Juan D. Tardós, Jos&eacu...
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
14 years 6 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
BMCBI
2010
142views more  BMCBI 2010»
13 years 5 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
ICALP
2000
Springer
13 years 9 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée