Sciweavers

3116 search results - page 598 / 624
» Design and implementation of network puzzles
Sort
View
CCS
2010
ACM
14 years 7 months ago
The limits of automatic OS fingerprint generation
Remote operating system fingerprinting relies on implementation differences between OSs to identify the specific variant executing on a remote host. Because these differences can ...
David W. Richardson, Steven D. Gribble, Tadayoshi ...
ANCS
2009
ACM
14 years 7 months ago
Range Tries for scalable address lookup
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
Ioannis Sourdis, Georgios Stefanakis, Ruben de Sme...
WWW
2011
ACM
14 years 4 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 1 months ago
STiCMAC: A MAC Protocol for Robust Space-Time Coding in Cooperative Wireless LANs
Relay-assisted cooperative wireless communication has been shown to have significant performance gains over the legacy direct transmission scheme. Compared with single relay base...
Pei Liu, Chun Nie, Thanasis Korakis, Elza Erkip, S...
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
15 years 9 months ago
FPGA: what's in it for a database?
While there seems to be a general agreement that next years' systems will include many processing cores, it is often overlooked that these systems will also include an increa...
Jens Teubner, René Müller