Sciweavers

383 search results - page 27 / 77
» A Bound on the Total Chromatic Number
Sort
View
TCS
2010
13 years 5 months ago
Resource allocation with time intervals
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and indu...
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
ICASSP
2010
IEEE
13 years 10 months ago
Energy efficient lossy transmission over sensor networks with feedback
The energy-distortion function (E(D)) for a network is defined as the minimum total energy required to achieve a target distortion D at the receiver without putting any restricti...
Aman Jain, Deniz Gündüz, Sanjeev R. Kulk...
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 10 months ago
Intermediate Performance of Rateless Codes
Abstract-- Fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. ...
Sujay Sanghavi
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
14 years 4 months ago
Cost-Aware Caching Algorithms for Distributed Storage Servers
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
Shuang Liang, Ke Chen, Song Jiang, Xiaodong Zhang
IWCMC
2009
ACM
14 years 4 months ago
Optimal cooperative spectrum sensing in cognitive sensor networks
This paper addresses the problem of optimal cooperative spectrum sensing in a cognitive-enabled sensor network where cognitive sensors can cooperate in the sensing of the spectrum...
Hai Ngoc Pham, Yan Zhang, Paal E. Engelstad, Tor S...