Sciweavers

374 search results - page 42 / 75
» Evaluating path queries over route collections
Sort
View
NSDI
2007
13 years 10 months ago
Information Slicing: Anonymity Using Unreliable Overlays
This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the...
Sachin Katti, Jeff Cohen, Dina Katabi
PODS
2007
ACM
225views Database» more  PODS 2007»
14 years 8 months ago
Sketching unaggregated data streams for subpopulation-size queries
IP packet streams consist of multiple interleaving IP flows. Statistical summaries of these streams, collected for different measurement periods, are used for characterization of ...
Edith Cohen, Nick G. Duffield, Haim Kaplan, Carste...
PPDP
2010
Springer
13 years 7 months ago
Deriving predicate statistics in datalog
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...
Senlin Liang, Michael Kifer
IAJIT
2010
87views more  IAJIT 2010»
13 years 7 months ago
A performance comparison of MD5 authenticated routing traffic with EIGRP, RIPv2, and OSPF
: Routing is the process of forwarding data across an inter-network from a designated source to a final destination. Along the way from source to destination, at least one intermed...
Khalid Abu Al-Saud, Hatim Mohd Tahir, Moutaz Saleh...
VLDB
2005
ACM
112views Database» more  VLDB 2005»
14 years 2 months ago
REED: Robust, Efficient Filtering and Event Detection in Sensor Networks
This paper presents a set of algorithms for efficiently evaluating join queries over static data tables in sensor networks. We describe and evaluate three algorithms that take adv...
Daniel J. Abadi, Samuel Madden, Wolfgang Lindner