Sciweavers

923 search results - page 143 / 185
» Proving the value of formal methods
Sort
View
CCS
2008
ACM
15 years 8 months ago
Minimal backups of cryptographic protocol runs
As cryptographic protocols execute they accumulate information such as values and keys, and evidence of properties about this information. As execution proceeds, new information b...
Jay A. McCarthy, Shriram Krishnamurthi
FMSD
2010
118views more  FMSD 2010»
15 years 4 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...
ACMICEC
2007
ACM
117views ECommerce» more  ACMICEC 2007»
15 years 10 months ago
Selectively acquiring ratings for product recommendation
Accurate prediction of customer preferences on products is the key to any recommender systems to realize its promised strategic values such as improved customer satisfaction and t...
Zan Huang
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 7 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
BMCBI
2010
117views more  BMCBI 2010»
15 years 6 months ago
Using jackknife to assess the quality of gene order phylogenies
Background: In recent years, gene order data has attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. If ge...
Jian Shi, Yiwei Zhang, Haiwei Luo, Jijun Tang