4212 search results - page 776 / 843 » On Compressible Pairings and Their Computation |
151
click to vote
CCR
2004
15 years 6 months ago
2004
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
158
click to vote
DCG
1998
15 years 6 months ago
1998
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not...
194
click to vote
PR
2007
15 years 5 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
175
click to vote
IMC
2010
ACM
15 years 4 months ago
2010
ACM
Operators and researchers want accurate router-level views of the Internet for purposes including troubleshooting and modeling. However, tools such as traceroute return IP address...
192
click to vote
ACSAC
2010
IEEE
14 years 10 months ago
2010
IEEE
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...