1139 search results - page 93 / 228 » Bounded Ideation Theory |
TCOM
2008
13 years 9 months ago
2008
Theories of shaping for lattice codes have been developed for systems (optical or non-optical) using coherent detection with additive white Gaussian noise (AWGN) and for direct-det...
JCSS
2007
13 years 9 months ago
2007
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
TCS
1998
13 years 8 months ago
1998
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
JCT
2010
13 years 7 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
JGT
2010
13 years 7 months ago
2010
: Let G be a toroidal graph without cycles of a fixed length k, and l(G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant...