2084 search results - page 67 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
SIGCOMM
2000
ACM
15 years 2 months ago
2000
ACM
In this paper, we present a model for TCP/IP ow control mechanism. The rate at which data is transmitted increases linearly in time until a packet loss is detected. At that point,...
RTCSA
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
NAACL
2007
14 years 11 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
FOCM
2010
14 years 8 months ago
2010
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...