Sciweavers

3008 search results - page 305 / 602
» Independence in connected graphs
Sort
View
HPCC
2009
Springer
15 years 4 months ago
Graph-Based Task Replication for Workflow Applications
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...
Raúl Sirvent, Rosa M. Badia, Jesús L...
CORR
2007
Springer
155views Education» more  CORR 2007»
15 years 6 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
MOBICOM
2006
ACM
16 years 21 days ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
127
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
A Measurement Based Rogue AP Detection Scheme
—This paper considers a category of rogue access points (APs) that pretend to be legitimate APs to lure users to connect to them. We propose a practical timing based technique th...
Hao Han, Bo Sheng, Chee Wei Tan, Qun Li, Sanglu Lu
ICIP
2008
IEEE
16 years 1 months ago
Distributed 3D dynamic mesh coding
In this paper, we propose a distributed 3D dynamic mesh coding system. The system is based on Slepian and Wolf’s and Wyner and Ziv’s information-theoretic results. Our system ...
M. Oguz Bici, Gozde Bozdagi Akar