Sciweavers

2610 search results - page 380 / 522
» Computational Probabilistic Non-interference
Sort
View
125
Voted
KDD
2003
ACM
149views Data Mining» more  KDD 2003»
16 years 3 months ago
Knowledge-based data mining
We describe techniques for combining two types of knowledge systems: expert and machine learning. Both the expert system and the learning system represent information by logical d...
Søren Damgaard, Sholom M. Weiss, Shubir Kap...
235
Voted
POPL
2008
ACM
16 years 3 months ago
Cryptographically sound implementations for typed information-flow security
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
Cédric Fournet, Tamara Rezk
145
Voted
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 3 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
139
Voted
SDM
2009
SIAM
129views Data Mining» more  SDM 2009»
16 years 20 days ago
Multi-topic Based Query-Oriented Summarization.
Query-oriented summarization aims at extracting an informative summary from a document collection for a given query. It is very useful to help users grasp the main information rel...
Dewei Chen, Jie Tang, Limin Yao
174
Voted
ICFEM
2009
Springer
15 years 10 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He