Sciweavers

67 search results - page 5 / 14
» The Expressiveness of a Family of Finite Set Languages
Sort
View
AAAI
2000
13 years 9 months ago
Semantics and Inference for Recursive Probability Models
In recent years, there have been several proposals that extend the expressive power of Bayesian networks with that of relational models. These languages open the possibility for t...
Avi Pfeffer, Daphne Koller
EDBT
2006
ACM
144views Database» more  EDBT 2006»
14 years 7 months ago
Towards Expressive Publish/Subscribe Systems
Traditional content based publish/subscribe (pub/sub) systems allow users to express stateless subscriptions evaluated on individual events. However, many applications such as moni...
Alan J. Demers, Johannes Gehrke, Mingsheng Hong, M...
IJISEC
2008
119views more  IJISEC 2008»
13 years 7 months ago
Estimating the maximum information leakage
Preventing improper information leaks is a greatest challenge of the modern society. In this paper we present a technique for measuring the ability of several families of adversari...
Alessandro Aldini, Alessandra Di Pierro
TCS
2008
13 years 7 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
DIAGRAMS
2004
Springer
13 years 11 months ago
What Can Spider Diagrams Say?
Spider diagrams are a visual notation for expressing logical statements. In this paper we identify a well known fragment of first order predicate logic, that we call ESD, equivalen...
Gem Stapleton, John Howse, John Taylor, Simon J. T...