Sciweavers

8540 search results - page 231 / 1708
» The Dynamic Servers Problem
Sort
View
IMC
2009
ACM
16 years 1 months ago
Moving beyond end-to-end path information to optimize CDN performance
Replicating content across a geographically distributed set of servers and redirecting clients to the closest server in terms of latency has emerged as a common paradigm for impro...
Rupa Krishnan, Harsha V. Madhyastha, Sridhar Srini...
WDAG
2007
Springer
100views Algorithms» more  WDAG 2007»
16 years 19 days ago
Scalable Load-Distance Balancing
We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a ...
Edward Bortnikov, Israel Cidon, Idit Keidar
INFOCOM
2010
IEEE
15 years 5 months ago
A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping
Abstract—With rising concerns on user privacy over the Internet, anonymous communication systems that hide the identity of a participant from its partner or third parties are hig...
Fengjun Li, Bo Luo, Peng Liu, Chao-Hsien Chu
CVPR
2010
IEEE
16 years 2 months ago
Moving Vistas: Exploiting Motion for Describing Scenes
Scene recognition in an unconstrained setting is an open and challenging problem with wide applications. In this paper, we study the role of scene dynamics for improved representa...
Nitesh Shroff, Pavan Turaga, Rama Chellappa
PLDI
2006
ACM
16 years 14 days ago
Practical dynamic software updating for C
Software updates typically require stopping and restarting an application, but many systems cannot afford to halt service, or would prefer not to. Dynamic software updating (DSU) ...
Iulian Neamtiu, Michael W. Hicks, Gareth Stoyle, M...