374 search results - page 29 / 75 » A Model of Fair Process and Its Limits |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— Current computing systems depend on adaptation mechanisms to ensure that they remain in quiescent operating regions. These regions are often defined using efficiency, fairnes...
INFOCOM
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper suggests that, to match an ideal Internet gateway which rigorously enforces fair sharing among competing TCP connections, an ideal TCP sender should possess two propert...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
The problem of recognizing actions in realistic videos
is challenging yet absorbing owing to its great potentials
in many practical applications. Most previous research is
limit...
QOFIS
2001
Springer
14 years 2 days ago
2001
Springer
With the lack of admission control and resource reservation mechanisms in the Internet, overload situations can only be avoided by having the end systems deploying congestion cont...
CIE
2010
Springer
13 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...