Sciweavers

4315 search results - page 20 / 863
» Sorting in linear time
Sort
View
ICIP
2007
IEEE
14 years 1 months ago
Fast Computation of Zernike Moments For Rice Sorting System
— In a rice sorting system, the separation distance of one grain from another is determined by the amount of time taken to process the image of each grain. The closer the separat...
Chong-Yaw Wee, Paramesran Raveendran, Fumiaki Take...
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
14 years 1 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
13 years 8 months ago
Derandomizing Algorithms for Routing and Sorting on Meshes
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
DAM
2010
104views more  DAM 2010»
13 years 6 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...