Sciweavers

2095 search results - page 398 / 419
» Improved pebbling bounds
Sort
View
SIGCOMM
2004
ACM
14 years 3 months ago
An algebraic approach to practical and scalable overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Han Hee Song, Randy H. Kat...
SIGCOMM
2004
ACM
14 years 3 months ago
Locating internet bottlenecks: algorithms, measurements, and implications
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
Ningning Hu, Erran L. Li, Zhuoqing Morley Mao, Pet...
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
14 years 3 months ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk
IDEAS
2003
IEEE
117views Database» more  IDEAS 2003»
14 years 3 months ago
A Multi-Resolution Block Storage Model for Database Design
We propose a new storage model called MBSM (Multiresolution Block Storage Model) for laying out tables on disks. MBSM is intended to speed up operations such as scans that are typ...
Jingren Zhou, Kenneth A. Ross
INFOCOM
2003
IEEE
14 years 3 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz