111
Voted
DAM
2007
15 years 16 days ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
CORR
2007
Springer
15 years 16 days ago
2007
Springer
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
93
Voted
IJBC
2006
15 years 17 days ago
2006
This paper deals with the problem of finding upper bounds on the number of periodic solutions of a class of one-dimensional non-autonomous differential equations: those with the r...
CORR
2006
Springer
15 years 18 days ago
2006
Springer
-- The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The u...
CORR
2006
Springer
15 years 18 days ago
2006
Springer
Abstract: We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a...
109
Voted
CORR
2006
Springer
15 years 18 days ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
COMBINATORICS
2006
15 years 18 days ago
2006
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...
97
Voted
DM
2008
15 years 19 days ago
2008
In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any ...
106
Voted
EM
2010
15 years 19 days ago
2010
Abstract. The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and...
DAM
2008
15 years 19 days ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...