Sciweavers

519 search results - page 87 / 104
» Factors in the Performance of the AN1 Computer Network
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 1 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
GROUP
2003
ACM
14 years 1 months ago
Using cursor prediction to smooth telepointer jitter
Telepointers are an important type of embodiment in real-time distributed groupware. Telepointers can increase the presence of remote participants and can provide considerable awa...
Carl Gutwin, Jeff Dyck, Jennifer Burkitt
MOBISYS
2006
ACM
14 years 7 months ago
Context-aware interactive content adaptation
Automatic adaptation of content for mobile devices is a challenging problem because optimal adaptation often depends on the usage semantics of content, as well as the context of u...
Iqbal Mohomed, Jim Chengming Cai, Sina Chavoshi, E...
SIGCOMM
2006
ACM
14 years 1 months ago
Planet scale software updates
Fast and effective distribution of software updates (a.k.a. patches) to millions of Internet users has evolved into a critical task over the last years. In this paper, we characte...
Christos Gkantsidis, Thomas Karagiannis, Milan Voj...
IMC
2006
ACM
14 years 1 months ago
Unexpected means of protocol inference
Network managers are inevitably called upon to associate network traffic with particular applications. Indeed, this operation is critical for a wide range of management functions...
Justin Ma, Kirill Levchenko, Christian Kreibich, S...