Sciweavers

7758 search results - page 125 / 1552
» On the Number of Distributive Lattices
Sort
View
COMBINATORICA
2008
87views more  COMBINATORICA 2008»
13 years 10 months ago
Quasi-randomness and the distribution of copies of a fixed graph
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
Asaf Shapira
IJES
2006
110views more  IJES 2006»
13 years 10 months ago
Partitioning bin-packing algorithms for distributed real-time systems
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...
Dionisio de Niz, Raj Rajkumar
COCOON
2005
Springer
14 years 3 months ago
Randomized Quicksort and the Entropy of the Random Source
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
Beatrice List, Markus Maucher, Uwe Schöning, ...
UAI
2004
13 years 11 months ago
On Modeling Profiles Instead of Values
We consider the problem of estimating the distribution underlying an observed sample of data. Instead of maximum likelihood, which maximizes the probability of the observed values...
Alon Orlitsky, Narayana P. Santhanam, Krishnamurth...
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 10 months ago
Intermediate Performance of Rateless Codes
Abstract-- Fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. ...
Sujay Sanghavi