Sciweavers

4004 search results - page 63 / 801
» How Many Packets Can We Encode
Sort
View
CCR
2010
110views more  CCR 2010»
15 years 2 months ago
An improved analysis of the lossy difference aggregator
We provide a detailed analysis of the Lossy Difference Aggregator, a recently developed data structure for measuring latency in a router environment where packet losses can occur....
Hilary Finucane, Michael Mitzenmacher
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
16 years 3 months ago
How to Determine a Good Multi-Programming Level for External Scheduling
Scheduling/prioritization of DBMS transactions is important for many applications that rely on database backends. A convenient way to achieve scheduling is to limit the number of ...
Bianca Schroeder, Mor Harchol-Balter, Arun Iyengar...
ANOR
2008
76views more  ANOR 2008»
15 years 2 months ago
Performance comparison of several priority schemes with priority jumps
In this paper, we consider several discrete-time priority queues with priority jumps. In a priority scheduling scheme with priority jumps, real-time and non-real-time packets arri...
Tom Maertens, Joris Walraevens, Herwig Bruneel
TIP
2010
121views more  TIP 2010»
14 years 9 months ago
Optimal PET Protection for Streaming Scalably Compressed Video Streams With Limited Retransmission Based on Incomplete Feedback
For streaming scalably compressed video streams over unreliable networks, Limited-Retransmission Priority Encoding Transmission (LR-PET) outperforms PET remarkably since the opport...
Ruiqin Xiong, David Taubman, Vijay Sivaraman
CTW
2007
121views more  CTW 2007»
15 years 2 months ago
Regularly irregular: how groups reconcile cross-cutting agendas and demand in healthcare
Abstract The flow of technical work in acute healthcare varies unpredictably, in patterns that occur regularly enough that they can be managed. Acute care organizations develop wa...
Christopher P. Nemeth, Mark Nunnally, Michael F. O...