2766 search results - page 349 / 554 » Algorithms for trigonometric polynomials |
141
Voted
IPL
2010
15 years 3 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
160
Voted
TAMC
2010
Springer
15 years 3 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
143
Voted
WIOPT
2010
IEEE
15 years 3 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...
256
click to vote
INFOCOM
2011
IEEE
14 years 8 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...
140
Voted
STOC
2006
ACM
16 years 5 months ago
2006
ACM
d Abstract] Dana Angluin James Aspnes Jiang Chen Yinghua Wu We propose a new model for exact learning of acyclic circuits using experiments in which chosen values may be assigned ...