Sciweavers

2095 search results - page 213 / 419
» Improved pebbling bounds
Sort
View
DCC
2008
IEEE
16 years 6 months ago
Server Placement in Multiple-Description-Based Media Streaming
Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a me...
Satyajeet Ahuja, Marwan Krunz
CHI
2010
ACM
16 years 1 months ago
gBook: an e-book reader with physical document navigation techniques
In this paper, we present gBook, a prototype for a new style of e-Book reader that uses flexible inputs and page orientation to simulate the properties of reading a bound printed ...
Jesse Burstyn, M. Anson Herriotts
GLOBECOM
2009
IEEE
16 years 1 months ago
Impact of Information on Network Performance - An Information-Theoretic Perspective
Abstract—Available network information is an important factor in determining network performance. In this paper, we study the basic limits on the amount of network information th...
Jun Hong, Victor O. K. Li
RTSS
2009
IEEE
16 years 1 months ago
Timing Analysis of Concurrent Programs Running on Shared Cache Multi-Cores
—Memory accesses form an important source of timing unpredictability. Timing analysis of real-time embedded software thus requires bounding the time for memory accesses. Multipro...
Yan Li, Vivy Suhendra, Yun Liang, Tulika Mitra, Ab...
IPPS
2009
IEEE
16 years 1 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...