2542 search results - page 273 / 509 » Computing Cartograms with Optimal Complexity |
107
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
104
Voted
SPIRE
2010
Springer
14 years 11 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
109
Voted
TCOM
2010
14 years 11 months ago
2010
—This paper analyzes the quality of service (QoS) of scheduling algorithms for heterogeneous users in multiuser (MU) wireless systems that take advantage from a crosslayer design...
124
Voted
VLSI
2010
Springer
14 years 11 months ago
2010
Springer
—In this paper, we introduce a design methodology to implement low-complexity and high-speed digital Finite Impulse Response (FIR) filters. Since FIR filters suffer from a larg...
103
Voted
WINET
2010
14 years 11 months ago
2010
Since wireless signals propagate through the ether, they are significantly affected by attenuation, fading, multipath, and interference. As a result, it is difficult to measure ...