478 search results - page 27 / 96 » A simple expected running time analysis for randomized |
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
MICCAI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Updating segmentation results in real-time based on repeated user input is a reliable way to guarantee accuracy, paramount in medical imaging applications, while making e...
SIGMETRICS
2004
ACM
14 years 1 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
GRID
2006
Springer
13 years 8 months ago
2006
Springer
In this work we report on data gathered via a deployment of a monitoring and benchmarking infrastructure on two production grid platforms, TeraGrid and Geon. Our result show that t...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...