Sciweavers

329 search results - page 12 / 66
» New lower bounds for some spherical designs
Sort
View
EPEW
2007
Springer
14 years 1 months ago
Closed Form Absorption Time Bounds
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...
Ana Busic, Nihal Pekergin
TIT
2008
90views more  TIT 2008»
13 years 7 months ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Gil Wiechman, Igal Sason
CORR
2004
Springer
113views Education» more  CORR 2004»
13 years 7 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers
JCT
2007
146views more  JCT 2007»
13 years 7 months ago
Laplacian spectral bounds for clique and independence numbers of graphs
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
Mei Lu, Huiqing Liu, Feng Tian
ASPDAC
2007
ACM
92views Hardware» more  ASPDAC 2007»
13 years 11 months ago
New Block-Based Statistical Timing Analysis Approaches Without Moment Matching
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...
Ruiming Chen, Hai Zhou