1092 search results - page 146 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
174
click to vote
WIOPT
2010
IEEE
15 years 4 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...
170
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
177
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
290
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
162
click to vote
GLVLSI
2010
IEEE
15 years 8 months ago
2010
IEEE
In this paper, we present an approved linear-time algorithm for statistical leakage analysis in the present of any spatial correlation condition (strong or weak). The new algorith...