Sciweavers

1184 search results - page 116 / 237
» Nearness relations and topology
Sort
View
IMC
2006
ACM
16 years 12 days ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
SASN
2006
ACM
16 years 12 days ago
Attacker traceback with cross-layer monitoring in wireless multi-hop networks
Denial-of-Service (DoS) and Distributed DoS (DDoS) attacks can cause serious problems in wireless networks due to its limited network/host resources. Attacker traceback is a promi...
Yongjin Kim, Ahmed Helmy
GI
2004
Springer
15 years 11 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
PODS
2010
ACM
215views Database» more  PODS 2010»
15 years 11 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
SMA
1999
ACM
106views Solid Modeling» more  SMA 1999»
15 years 10 months ago
Resolving non-uniqueness in design feature histories
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
Vincent A. Cicirello, William C. Regli