Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CORR
2004
Springer
113views Education» more  CORR 2004»
10 years 11 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
APAL
2004
81views more  APAL 2004»
10 years 11 months ago
The complexity of first-order and monadic second-order logic revisited
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
Markus Frick, Martin Grohe
TSP
2008
103views more  TSP 2008»
10 years 11 months ago
Bounds for Estimation of Covariance Matrices From Heterogeneous Samples
Abstract--This correspondence derives lower bounds on the meansquare error (MSE) for the estimation of a covariance matrix , using samples k = 1; . . . ; K, whose covariance matric...
Olivier Besson, Stéphanie Bidon, Jean-Yves ...
TSP
2008
119views more  TSP 2008»
10 years 11 months ago
MIMO Relaying With Linear Processing for Multiuser Transmission in Fixed Relay Networks
In this paper, a novel relaying strategy that uses multiple input multiple output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks...
Chan-Byoung Chae, Taiwen Tang, Robert W. Heath Jr....
JCT
2007
112views more  JCT 2007»
10 years 11 months ago
On generalized Kneser hypergraph colorings
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sssS, “generalized r-uniform Kneser hypergraphs with intersection multi...
Carsten E. M. C. Lange, Günter M. Ziegler
JC
2007
64views more  JC 2007»
10 years 11 months ago
Quadrature in Besov spaces on the Euclidean sphere
Let q ≥ 1 be an integer, Sq denote the unit sphere embedded in the Euclidean space Rq+1, and µq be its Lebesgue surface measure. We establish upper and lower bounds for sup f...
Kerstin Hesse, H. N. Mhaskar, Ian H. Sloan
JC
2007
130views more  JC 2007»
10 years 11 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
TIT
2008
90views more  TIT 2008»
10 years 11 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
TCS
2008
10 years 11 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna
SIAMDM
2008
79views more  SIAMDM 2008»
10 years 11 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
books