Sciweavers

92 search results - page 16 / 19
» An Optimal Lower Bound on the Number of Variables for Graph ...
Sort
View
CORR
2007
Springer
134views Education» more  CORR 2007»
13 years 7 months ago
Rate-Constrained Wireless Networks with Fading Channels: Interference-Limited and Noise-Limited Regimes
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
Masoud Ebrahimi, Amir K. Khandani
TIT
2010
94views Education» more  TIT 2010»
13 years 2 months ago
Rewriting codes for joint information storage in flash memories
Abstract--Memories whose storage cells transit irreversibly between states have been common since the start of the data storage technology. In recent years, flash memories have bec...
Anxiao Jiang, Vasken Bohossian, Jehoshua Bruck
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 7 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 2 months ago
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
Marek Chrobak, Jiri Sgall
INFOCOM
2008
IEEE
14 years 2 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff