Sciweavers

7758 search results - page 162 / 1552
» On the Number of Distributive Lattices
Sort
View
JAL
2002
64views more  JAL 2002»
15 years 6 months ago
Quicksort asymptotics
The number of comparisons Xn used by Quicksort to sort an array of n distinct numbers has mean
James Allen Fill, Svante Janson
ESANN
2004
15 years 7 months ago
Robust Bayesian Mixture Modelling
Abstract. Bayesian approaches to density estimation and clustering using mixture distributions allow the automatic determination of the number of components in the mixture. Previou...
Christopher M. Bishop, Markus Svensén
DEXAW
2003
IEEE
86views Database» more  DEXAW 2003»
15 years 11 months ago
Towards an Autonomic Distributed Computing System
Increasing hardware performance of desktop computers accounts for a low-cost computing potential that is waiting to be efficiently used. However, the complexity of installation a...
Zoran Constantinescu
SAC
1998
ACM
15 years 10 months ago
Open, distributed coordination with finesse
Coordination languages have recently been attracting signi cant attention as a means of programming parallel and distributed systems. The approach of separating coordination from ...
Andrew Berry, Simon M. Kaplan
PODC
2009
ACM
16 years 7 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...