Sciweavers

1552 search results - page 256 / 311
» On the Complexity of Constant Propagation
Sort
View
TSP
2010
14 years 6 months ago
Low-complexity decoding via reduced dimension maximum-likelihood search
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer, Nam...
TWC
2010
14 years 6 months ago
Channel Diversity in Random Wireless Networks
The goal of this paper is to explore the benefits of channel diversity in wireless ad hoc networks. Our model is that of a Poisson point process of transmitters, each with a recei...
Kostas Stamatiou, John G. Proakis, James R. Zeidle...
PDP
2011
IEEE
14 years 3 months ago
Transport Optimization in Peer-to-Peer Networks
Abstract—The peer-to-peer networking concept has revolutionized the cost structure of Internet data dissemination by making large scale content delivery with low server cost feas...
Konstantin Miller, Adam Wolisz
COMGEO
2012
ACM
13 years 7 months ago
Algorithms for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
Sergio Cabello, Éric Colin de Verdiè...
MOBIHOC
2012
ACM
13 years 2 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn