Results 1  10
of
4,172,289
New Lower Bounds on the Periodic
, 1999
"... In this paper, we consider a recent technique of Levenshtein [9] which was introduced to prove improved lower bounds on aperiodic correlation of sequencef amilies over the complex roots of unity. ..."
Abstract
 Add to MetaCart
In this paper, we consider a recent technique of Levenshtein [9] which was introduced to prove improved lower bounds on aperiodic correlation of sequencef amilies over the complex roots of unity.
A New Lower Bound for
, 712
"... We construct a recordbreaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We construct a recordbreaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords. 1
New lower bound techniques for VLSI
 Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science
, 1981
"... lllIIIhlllhllI ..."
New lower bounds for parallel computation
 In Proceedings of the 18 th Annual ACM Symposium on Theory of Computing
, 1986
"... Abstract. Lower bounds are proven on the paralleltime complexity of several basic functions on the most powerful concurrentread concurrentwrite PRAM with unlimited shared memory and unlimited power of individual processors (denoted by PRIORITY(m)): (1) It is proved that with a number of processor ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
polynomial in n. (2) An R(log n) lower bound is given for PRIORITY(m) with no” ’ processors on a function with inputs from (0, 11, namely for the functionf(xl,.,x.) = C:‘=, x,a ’ where a is fixed and x, E (0, 1). (3) Finally, by a new efficient simulation of PRIORITY(m) by unbounded fanin circuits
New Lower Bounds For Orthogonal Drawings
 J. GRAPH ALGORITHMS APPL
, 1998
"... An orthogonal drawing of a graph is an embedding of the graph in the twodimensional grid such that edges are routed along gridlines. In this paper we explore lower bounds for orthogonal graph drawings. We prove lower bounds on the number of bends and, when crossings are not allowed, also lower bou ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
An orthogonal drawing of a graph is an embedding of the graph in the twodimensional grid such that edges are routed along gridlines. In this paper we explore lower bounds for orthogonal graph drawings. We prove lower bounds on the number of bends and, when crossings are not allowed, also lower
New Lower Bounds for Halfspace Emptiness
 Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci
, 1996
"... We derive a lower bound of\Omega\Gamma n 4=3 ) for the halfspace emptiness problem: Given a set of n points and n hyperplanes in IR 5 , is every point above every hyperplane? This matches the best known upper bound to within polylogarithmic factors, and improves the previous best lower bound of \Ome ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We derive a lower bound of\Omega\Gamma n 4=3 ) for the halfspace emptiness problem: Given a set of n points and n hyperplanes in IR 5 , is every point above every hyperplane? This matches the best known upper bound to within polylogarithmic factors, and improves the previous best lower bound
Entropy, some new lower bounds
"... We derive second order lower bounds for the entropy function expressed in terms of the index of coincidence. The constants found either explicitly or implicitly are best possible in a natural sense. ..."
Abstract
 Add to MetaCart
We derive second order lower bounds for the entropy function expressed in terms of the index of coincidence. The constants found either explicitly or implicitly are best possible in a natural sense.
New lower bounds for Heilbronn numbers
, 2002
"... The nth Heilbronn number, H_n, is the largest value such that n points can be placed in the unit square in such a way that all possible triangles defined by any three of the points have area at least H_n. In this note we establish new bounds for the first Heilbronn numbers. These new values have be ..."
Abstract
 Add to MetaCart
The nth Heilbronn number, H_n, is the largest value such that n points can be placed in the unit square in such a way that all possible triangles defined by any three of the points have area at least H_n. In this note we establish new bounds for the first Heilbronn numbers. These new values have
New lower bounds and constructions for binary codes correcting asymmetric errors
 IEEE Trans. Inform. Theory
, 2003
"... Title New lower bounds and constructions for binary codescorrecting asymmetric errors ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Title New lower bounds and constructions for binary codescorrecting asymmetric errors
A New Lower Bound on the Independence Number of Graphs✩
"... We propose a new lower bound on the independence number of a graph. We show that our bound compares favorably to recent ones (e.g. [12]). We obtain our bound by using the BhatiaDavis inequality applied with analytical results (minimum, maximum, expectation and variance) of an algorithm for the vert ..."
Abstract
 Add to MetaCart
We propose a new lower bound on the independence number of a graph. We show that our bound compares favorably to recent ones (e.g. [12]). We obtain our bound by using the BhatiaDavis inequality applied with analytical results (minimum, maximum, expectation and variance) of an algorithm
Results 1  10
of
4,172,289