Sciweavers

1359 search results - page 143 / 272
» Probabilistic Points-to Analysis
Sort
View
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 2 months ago
Approximate Medians and other Quantiles in One Pass and with Limited Memory
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G....
ICCAD
1996
IEEE
102views Hardware» more  ICCAD 1996»
15 years 2 months ago
Bit-flipping BIST
A scan-based BIST scheme is presented which guarantees complete fault coverage with very low hardware overhead. A probabilistic analysis shows that the output of an LFSR which fee...
Hans-Joachim Wunderlich, Gundolf Kiefer
CAAP
1992
15 years 2 months ago
Varieties of Increasing Trees
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
François Bergeron, Philippe Flajolet, Bruno...
IAT
2009
IEEE
15 years 1 months ago
Efficient Distributed Bayesian Reasoning via Targeted Instantiation of Variables
Abstract--This paper is focusing on exact Bayesian reasoning in systems of agents, which represent weakly coupled processing modules supporting collaborative inference through mess...
Patrick de Oude, Gregor Pavlin
ACSAC
2004
IEEE
15 years 1 months ago
Designing Good Deceptions in Defense of Information Systems
Since attackers trust computer systems to tell them the truth, it may be effective for those systems to lie or mislead. This could waste the attacker's resources while permit...
Neil C. Rowe