Sciweavers

85 search results - page 6 / 17
» Distribution sort with randomized cycling
Sort
View
SPAA
2003
ACM
15 years 2 months ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
ICML
2009
IEEE
15 years 10 months ago
Unsupervised hierarchical modeling of locomotion styles
This paper describes an unsupervised learning technique for modeling human locomotion styles, such as distinct related activities (e.g. running and striding) or variations of the ...
Wei Pan, Lorenzo Torresani
CORR
2000
Springer
71views Education» more  CORR 2000»
14 years 9 months ago
Smoothness and decay properties of the limiting Quicksort density function
Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere ...
James Allen Fill, Svante Janson
PDP
2007
IEEE
15 years 3 months ago
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
Andreas Beckmann, Jorg Keller
GLOBECOM
2010
IEEE
14 years 7 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun