501 search results - page 51 / 101 » Communication Lower Bounds Using Dual Polynomials |
EJC
2008
13 years 9 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
GLOBECOM
2009
IEEE
14 years 3 days ago
2009
IEEE
—Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limite...
WG
1998
Springer
14 years 1 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— This paper presents a new double space-time transmit diversity-orthogonal frequency division multiplexing (DSTTD-OFDM) scheme using the zero-forcing decisionfeedback (ZF-DF) de...
COLT
2010
Springer
13 years 6 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...