Sciweavers

101 search results - page 16 / 21
» A Classification of Time and or Probability Dependent Securi...
Sort
View
SP
2009
IEEE
14 years 2 months ago
The Mastermind Attack on Genomic Data
In this paper, we study the degree to which a genomic string, Q, leaks details about itself any time it engages in comparison protocols with a genomic querier, Bob, even if those ...
Michael T. Goodrich
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
13 years 7 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
FMSD
2010
118views more  FMSD 2010»
13 years 6 months ago
On simulation-based probabilistic model checking of mixed-analog circuits
In this paper, we consider verifying properties of mixed-signal circuits, i.e., circuits for which there is an interaction between analog (continuous) and digital (discrete) values...
Edmund M. Clarke, Alexandre Donzé, Axel Leg...

Publication
203views
13 years 7 months ago
Multigraph Sampling of Online Social Networks
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
Minas Gjoka, Carter T. Butts, Maciej Kurant, Athin...
TSP
2008
151views more  TSP 2008»
13 years 7 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...