Sciweavers

1599 search results - page 163 / 320
» Probabilistic Analysis of Anonymity
Sort
View
IBPRIA
2003
Springer
14 years 1 months ago
Smoothing Techniques for Tree-k-Grammar-Based Natural Language Modeling
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
Jose L. Verdú-Mas, Jorge Calera-Rubio, Rafa...
ICALP
2001
Springer
14 years 23 days ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
Amit Chakrabarti, Subhash Khot
ICMLA
2008
13 years 9 months ago
Detection of Sequential Outliers Using a Variable Length Markov Model
Mining for outliers in sequential databases is crucial to forward appropriate analysis of data. Therefore, many approaches for the discovery of such anomalies have been proposed. ...
Cécile Low-Kam, Anne Laurent, Maguelonne Te...
WCET
2008
13 years 9 months ago
INFER: Interactive Timing Profiles based on Bayesian Networks
We propose an approach for timing analysis of software-based embedded computer systems that builds on the established probabilistic framework of Bayesian networks. We envision an ...
Michael Zolda
UAI
1993
13 years 9 months ago
On reasoning in networks with qualitative uncertainty
In this paper some initialwork towards a new approach to qualitative reasoning under uncertainty is presented. This method is not only applicable to qualitative probabilistic reas...
Simon Parsons, E. H. Mamdani