1998 search results - page 347 / 400 » Complexity of the Cover Polynomial |
107
click to vote
WIOPT
2010
IEEE
14 years 11 months ago
2010
IEEE
—In this paper, we explore physical layer cooperative communication in order to design network layer routing algorithms that are energy efficient. We assume each node in the net...
99
Voted
PIMRC
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper tackles the problem of fast varying channel estimation in LTE systems. Particular attention is given to downlink transmission where OFDMA is used as the multiple access ...
104
Voted
SEMWEB
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
129
Voted
ECRTS
2009
IEEE
14 years 10 months ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
118
Voted
CC
2010
Springer
14 years 10 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...