Sciweavers

151 search results - page 27 / 31
» Cleaning a network with brushes
Sort
View
CCR
2010
139views more  CCR 2010»
13 years 7 months ago
Longitudinal study of BGP monitor session failures
BGP routing data collected by RouteViews and RIPE RIS have become an essential asset to both the network research and operation communities. However, it has long been speculated t...
Pei-chun Cheng, Xin Zhao, Beichuan Zhang, Lixia Zh...
ICFP
2003
ACM
14 years 7 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
ICDE
2010
IEEE
801views Database» more  ICDE 2010»
14 years 7 months ago
The Similarity Join Database Operator
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
Mohamed H. Ali, Walid G. Aref, Yasin N. Silva
SPW
2004
Springer
14 years 25 days ago
Privacy Is Linking Permission to Purpose
Abstract Fabio Massacci1 and Nicola Zannone1 Department of Information and Communication Technology University of Trento - Italy {massacci,zannone} at dit.unitn.it The last years h...
Fabio Massacci, Nicola Zannone
PODS
2010
ACM
215views Database» more  PODS 2010»
14 years 17 days 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