4795 search results - page 119 / 959 » The Message Classification Model |
CIE
2008
Springer
14 years 10 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
COMPOS
1997
Springer
15 years 2 months ago
1997
Springer
We introduce a mathematical model of components that can be used for the description of both hardware and software units forming distributed interactive systems. As part of a distr...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We propose a simple and efficient approach to building undirected probabilistic classification models (Markov networks) that extend na
PKC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
This paper surveys recent work in applying ideas from graphical models and message passing algorithms to solve large scale regularized regression problems. In particular, the focu...