Sciweavers

1578 search results - page 155 / 316
» Algorithmic randomness of continuous functions
Sort
View
JAL
2002
69views more  JAL 2002»
13 years 9 months ago
Rates of convergence for Quicksort
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
Ralph Neininger, Ludger Rüschendorf
CDC
2009
IEEE
111views Control Systems» more  CDC 2009»
14 years 2 months ago
On fusion of information from multiple sensors in the presence of analog erasure links
— Consider multiple sensors that transmit data over analog erasure links to an estimation center. The sensors have access to distinct entries of the output vector of a linear and...
Vijay Gupta, Nuno C. Martins
OSDI
2000
ACM
13 years 11 months ago
Policies for Dynamic Clock Scheduling
Pocket computers are beginning to emerge that provide sufficient processing capability and memory capacity to run traditional desktop applications and operating systems on them. T...
Dirk Grunwald, Philip Levis, Keith I. Farkas, Char...
TSP
2008
178views more  TSP 2008»
13 years 10 months ago
Digital Computation of Linear Canonical Transforms
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
A. Koc, Haldun M. Özaktas, Cagatay Candan, M....
CVPR
2009
IEEE
15 years 5 months ago
Global Optimization for Alignment of Generalized Shapes
In this paper, we introduce a novel algorithm to solve global shape registration problems. We use gray-scale “images” to represent source shapes, and propose a novel twocompo...
Hongsheng Li (Lehigh University), Tian Shen (Lehig...