Sciweavers

Share
DAM
2007
141views more  DAM 2007»
9 years 1 months ago
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
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...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
CORR
2007
Springer
82views Education» more  CORR 2007»
9 years 1 months ago
Sorting and Selection with Random Costs
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...
Stanislav Angelov, Keshav Kunal, Andrew McGregor
IJBC
2006
91views more  IJBC 2006»
9 years 1 months ago
Limit Cycles for Generalized Abel Equations
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...
Armengol Gasull, Antoni Guillamon
CORR
2006
Springer
88views Education» more  CORR 2006»
9 years 1 months ago
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
-- 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...
Moshe Twitto, Igal Sason, Shlomo Shamai
CORR
2006
Springer
81views Education» more  CORR 2006»
9 years 1 months ago
Low density codes achieve the rate-distortion bound
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...
Emin Martinian, Martin J. Wainwright
CORR
2006
Springer
176views Education» more  CORR 2006»
9 years 1 months ago
On the Fingerprinting Capacity Under the Marking Assumption
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...
N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya...
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
9 years 1 months ago
Drawing a Graph in a Hypercube
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...
David R. Wood
DM
2008
119views more  DM 2008»
9 years 1 months ago
A generalised upper bound for the k-tuple domination number
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 ...
Andrei Gagarin, Vadim E. Zverovich
EM
2010
134views Management» more  EM 2010»
9 years 1 months ago
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
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...
Hans D. Mittelmann, Frank Vallentin
DAM
2008
111views more  DAM 2008»
9 years 1 months ago
Sums of squares based approximation algorithms for MAX-SAT
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...
Hans van Maaren, Linda van Norden, M. J. H. Heule
books