29908 search results - page 196 / 5982 » On the Complexity of |
145
click to vote
TIT
1998
15 years 6 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
219
click to vote
GLOBECOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Wireless networks, especially mobile ad hoc networks (MANET) and cognitive radio networks (CRN), are facing two new challenges beyond traditional random network model: op...
213
click to vote
TNN
2010
15 years 1 months ago
2010
Abstract--In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discretetime stochastic complex networks with randomly occurr...
174
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
198
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
This article introduces the absolute quadratic complex formed by all lines that intersect the absolute conic. If denotes the 3 ? 3 symmetric matrix representing the image of that ...