Sciweavers

990 search results - page 107 / 198
» An efficient data structure for network anomaly detection
Sort
View
SIGMOD
2006
ACM
174views Database» more  SIGMOD 2006»
14 years 8 months ago
Dynamic authenticated index structures for outsourced databases
In outsourced database (ODB) systems the database owner publishes its data through a number of remote servers, with the goal of enabling clients at the edge of the network to acce...
Feifei Li, Marios Hadjieleftheriou, George Kollios...
TMC
2008
91views more  TMC 2008»
13 years 8 months ago
Efficient and Resilient Backbones for Multihop Wireless Networks
We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-toend connectivity, allowing non-backbone nodes to save energy sin...
Seungjoon Lee, Bobby Bhattacharjee, Aravind Sriniv...
IVS
2008
121views more  IVS 2008»
13 years 8 months ago
Using treemaps for variable selection in spatio-temporal visualisation
We demonstrate and reflect upon the use of enhanced treemaps that incorporate spatial and temporal ordering for exploring a large multivariate spatio-temporal data set. The result...
Aidan Slingsby, Jason Dykes, Jo Wood
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 8 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
PLILP
1994
Springer
13 years 11 months ago
Deriving Residual Reference Count Garbage Collectors
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
Wolfram Schulte