DM
2008
13 years 4 months ago
2008
We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for...
DCG
2008
13 years 4 months ago
2008
Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This imp...
DCG
2008
13 years 4 months ago
2008
We prove that for d 3, the 1-skeleton of any (d - 1)-dimensional doubly Cohen-Macaulay (abbreviated 2-CM) complex is generically drigid. This implies that Barnette's lower b...
DAM
2008
13 years 4 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
ECCC
2010
13 years 4 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k,...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract-- We analyze the performance of low-density generator matrix (LDGM) codes for lossy source coding. We first develop a generic technique for deriving lower bounds on the ef...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
With the advent of autonomous robots with two- and three-dimensional scanning capabilities, classical visibility-based exploration methods from computational geometry have gained ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We consider Metropolis Glauber dynamics for sampling proper qcolourings of the n-vertex complete b-ary tree when 3 q b/2 ln(b). We give both upper and lower bounds on the mixing...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
New upper and lower bounds are presented on the capacity of the free-space optical intensity channel. This channel is characterized by inputs that are nonnegative (representing the...