Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Prem Gopalan"'
Publikováno v:
Computer Networks. 50:2255-2270
Quality of service (QoS) provisioning for dynamically composable software elements in a programmable router has not received much attention. We present a router platform that supports extensible and configurable routing elements, and provides them wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a684817e3b0cd0c0835f4a237d1ec7d
https://doi.org/10.1016/j.comnet.2005.08.008
https://doi.org/10.1016/j.comnet.2005.08.008
Publikováno v:
Nature genetics
One of the major goals of population genetics is to quantitatively understand variation of genetic polymorphisms among individuals. To this end, researchers have developed sophisticated statistical methods to capture the complex population structure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3900e0cc25865805025068356a5c5b24
https://doi.org/10.1101/013227
https://doi.org/10.1101/013227
Autor:
Prem Gopalan, David M. Blei
Publikováno v:
Proceedings of the National Academy of Sciences of the United States of America. 110(36)
Detecting overlapping communities is essential to analyzing and exploring natural networks such as social networks, biological networks, and citation networks. However, most existing approaches do not scale to the size of networks that we regularly o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::feb0de42445d20622ecbe164c2e0bdb5
https://pubmed.ncbi.nlm.nih.gov/23950224
https://pubmed.ncbi.nlm.nih.gov/23950224
Autor:
Steven Y. Ko, Matvey Arye, Prem Gopalan, Michael J. Freedman, David Shue, Erik Nordström, Jennifer Rexford
Online services are typically replicated on multiple servers in different datacenters, and have (at best) a loose association with specific end-hosts or locations. To meet the needs of these online services, we introduce SCAFFOLD--an architecture tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af721647406f65d89a1650441d529a76
https://doi.org/10.21236/ada571380
https://doi.org/10.21236/ada571380
Publikováno v:
WORM
This paper presents two simple algorithms, TreeCount and SenderCount that detect a broad range of exploit-based and email worms, respectively. These algorithms, when combined with automated payload fingerprinting, generate precise worm payload signat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab30d27fd5c4fd9d53808c6c0d5397f5
https://doi.org/10.1145/1179542.1179557
https://doi.org/10.1145/1179542.1179557