Sciweavers

8298 search results - page 1559 / 1660
» On the Complexity of Numerical Analysis
Sort
View
COMPGEOM
2009
ACM
15 years 4 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
COMPGEOM
2009
ACM
15 years 4 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
IMC
2009
ACM
15 years 4 months ago
On calibrating enterprise switch measurements
The complexity of modern enterprise networks is ever-increasing, and our understanding of these important networks is not keeping pace. Our insight into intra-subnet traffic (sta...
Boris Nechaev, Vern Paxson, Mark Allman, Andrei Gu...
SIGCOMM
2009
ACM
15 years 4 months ago
VL2: a scalable and flexible data center network
To be agile and cost effective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to...
Albert G. Greenberg, James R. Hamilton, Navendu Ja...
SIGECOM
2009
ACM
100views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
The price of uncertainty
We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...
Maria-Florina Balcan, Avrim Blum, Yishay Mansour
« Prev « First page 1559 / 1660 Last » Next »