817 search results - page 44 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
GLOBECOM
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper, we propose a new decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) which achieves near Maximum Likelihood (ML) performance while substanti...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
KDD
1997
ACM
14 years 25 days ago
1997
ACM
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
GLOBECOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtai...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...