248 search results - page 22 / 50 » A Simple Optimal Randomized Algorithm for Sorting on the PDM |
CORR
2010
Springer
13 years 7 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...
DEBU
2010
13 years 5 months ago
2010
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
IFIP
2003
Springer
14 years 28 days ago
2003
Springer
Sensor networks are being used for implementation of a large number of applications involving distributed and collaborative computation. Extensive research has focused upon design ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
JACM
2000
13 years 7 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...