Sciweavers

2498 search results - page 117 / 500
» Data Structures with Unpredictable Timing
Sort
View
IMC
2005
ACM
15 years 3 months ago
Exploiting Underlying Structure for Detailed Reconstruction of an Internet-scale Event
Network “telescopes” that record packets sent to unused blocks of Internet address space have emerged as an important tool for observing Internet-scale events such as the spre...
Abhishek Kumar, Vern Paxson, Nicholas Weaver
DBPL
1993
Springer
95views Database» more  DBPL 1993»
15 years 2 months ago
A Moose and a Fox Can Aid Scientists with Data Management Problems
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments, an object-oriented data model at the core of a scient...
Janet L. Wiener, Yannis E. Ioannidis
SPDP
1993
IEEE
15 years 2 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
TON
2002
86views more  TON 2002»
14 years 9 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar
CIKM
1997
Springer
15 years 2 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
Jie Cheng, David A. Bell, Weiru Liu