4315 search results - page 63 / 863 » Sorting in linear time |
118
Voted
HYBRID
2009
Springer
15 years 9 months ago
2009
Springer
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...
123
Voted
ICRA
2003
IEEE
15 years 8 months ago
2003
IEEE
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 ...
111
Voted
IBPRIA
2003
Springer
15 years 8 months ago
2003
Springer
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...
132
Voted
RC
2007
15 years 2 months ago
2007
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 ...
124
Voted
SODA
1992
ACM
15 years 3 months ago
1992
ACM
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 ...