Zobrazeno 1 - 10
of 169
pro vyhledávání: '"MAGGS, BRUCE"'
Autor:
Kepner, Jeremy, Bernays, Jonathan, Buckley, Stephen, Cho, Kenjiro, Conrad, Cary, Daigle, Leslie, Erhardt, Keeley, Gadepally, Vijay, Greene, Barry, Jones, Michael, Knake, Robert, Maggs, Bruce, Michaleas, Peter, Meiners, Chad, Morris, Andrew, Pentland, Alex, Pisharody, Sandeep, Powazek, Sarah, Prout, Andrew, Reiner, Philip, Suzuki, Koichi, Takahashi, Kenji, Tauber, Tony, Walker, Leah, Stetson, Douglas
Adversarial Internet robots (botnets) represent a growing threat to the safe use and stability of the Internet. Botnets can play a role in launching adversary reconnaissance (scanning and phishing), influence operations (upvoting), and financing oper
Externí odkaz:
http://arxiv.org/abs/2201.06068
This paper presents universal algorithms for clustering problems, including the widely studied $k$-median, $k$-means, and $k$-center objectives. The input is a metric space containing all potential client locations. The algorithm must select $k$ clus
Externí odkaz:
http://arxiv.org/abs/2105.02363
Robust optimization is a widely studied area in operations research, where the algorithm takes as input a range of values and outputs a single solution that performs well for the entire range. Specifically, a robust algorithm aims to minimize regret,
Externí odkaz:
http://arxiv.org/abs/2005.08137
Autor:
Haney, Samuel, Liaee, Mehraneh, Maggs, Bruce M., Panigrahi, Debmalya, Rajaraman, Rajmohan, Sundaram, Ravi
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the restriction of
Externí odkaz:
http://arxiv.org/abs/1904.11946
Autor:
Bozkurt, Ilker Nadi, Aqeel, Waqar, Bhattacherjee, Debopam, Chandrasekaran, Balakrishnan, Godfrey, Philip Brighten, Laughlin, Gregory, Maggs, Bruce M., Singla, Ankit
The recent publication of the `InterTubes' map of long-haul fiber-optic cables in the contiguous United States invites an exciting question: how much faster would the Internet be if routes were chosen to minimize latency? Previous measurement campaig
Externí odkaz:
http://arxiv.org/abs/1811.10737
Autor:
Bhattacherjee, Debopam, Jyothi, Sangeetha Abdu, Bozkurt, Ilker Nadi, Tirmazi, Muhammad, Aqeel, Waqar, Aguirre, Anthony, Chandrasekaran, Balakrishnan, Godfrey, P. Brighten, Laughlin, Gregory P., Maggs, Bruce M., Singla, Ankit
Low latency is a requirement for a variety of interactive network applications. The Internet, however, is not optimized for latency. We thus explore the design of cost-effective wide-area networks that move data over paths very close to great-circle
Externí odkaz:
http://arxiv.org/abs/1809.10897
In principle, a network can transfer data at nearly the speed of light. Today's Internet, however, is much slower: our measurements show that latencies are typically more than one, and often more than two orders of magnitude larger than the lower bou
Externí odkaz:
http://arxiv.org/abs/1505.03449
We present a polynomial time approximation algorithm for constructing an overlay multicast network for streaming live media events over the Internet. The class of overlay networks constructed by our algorithm include networks used by Akamai Technolog
Externí odkaz:
http://arxiv.org/abs/1109.4114
Publikováno v:
Journal of the ACM; Jul2022, Vol. 69 Issue 4, p1-49, 49p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.