2542 search results - page 36 / 509 » Computing Cartograms with Optimal Complexity |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...
ECCC
2000
13 years 7 months ago
2000
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
CRYPTO
2001
Springer
14 years 5 days ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
GLOBECOM
2008
IEEE
13 years 7 months ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
JSAC
2008
13 years 7 months ago
2008
Abstract--Optimal tone allocation in downlink OFDMA networks is a non-convex NP-hard problem that requires extensive feedback for channel information. In this paper, two constantco...