4679 search results - page 49 / 936 » Modeling When Connections Are the Problem |
STOC
2010
ACM
15 years 5 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
128
click to vote
IANDC
2008
15 years 1 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
118
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
133
click to vote
MASCOTS
2004
15 years 2 months ago
2004
In this paper we investigate the burstiness of the Transmission Control Protocol (TCP) and its impact on a network of finite TCP connections. A detailed TCP and network model is d...
105
click to vote
NETWORKING
2008
15 years 2 months ago
2008
The presence of Network Address Translation (NAT) is a hindrance when accessing services within home networks, because NAT breaks the end-to-end connectivity model of the Internet ...