Sciweavers

4315 search results - page 63 / 863
» Sorting in linear time
Sort
View
HYBRID
2009
Springer
14 years 2 months ago
Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
Radu Grosu
ICRA
2003
IEEE
116views Robotics» more  ICRA 2003»
14 years 28 days 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...
IBPRIA
2003
Springer
14 years 26 days ago
Hash-Like Fractal Image Compression with Linear Execution Time
The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison...
Kostadin Koroutchev, José R. Dorronsoro
RC
2007
148views more  RC 2007»
13 years 7 months ago
Computing Population Variance and Entropy under Interval Uncertainty: Linear-Time Algorithms
In statistical analysis of measurement results, it is often necessary to compute the range [V , V ] of the population variance V = 1 n · n i=1 (xi −E)2 (where E = 1 n · n i=1 ...
Gang Xiang, Martine Ceberio, Vladik Kreinovich
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
13 years 8 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...