Sciweavers

4315 search results - page 25 / 863
» Sorting in linear time
Sort
View
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 7 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
AUTOMATICA
2004
71views more  AUTOMATICA 2004»
13 years 7 months ago
Nonlinear observers for perspective time-invariant linear systems
Perspective dynamical systems arise in machine vision, in which only perspective observation is available. This paper proposes and studies a Luenberger-type nonlinear observer for...
Rixat Abdursul, Hiroshi Inaba, Bijoy K. Ghosh
FPL
2008
Springer
117views Hardware» more  FPL 2008»
13 years 9 months ago
A versatile hardware architecture for a CFAR detector based on a linear insertion sorter
This paper presents a versatile hardware architecture that implements six variant of the CFAR detector based on linear and non-linear operations. Since some implemented CFAR detec...
Roberto Perez-Andrade, René Cumplido, Claud...
JPDC
2008
135views more  JPDC 2008»
13 years 7 months ago
Fast parallel GPU-sorting using a hybrid algorithm
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
Erik Sintorn, Ulf Assarsson
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 2 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer