1029 search results - page 89 / 206 » Probabilistic Recurrence Relations |
112
Voted
ERCIMDL
2007
Springer
15 years 9 months ago
2007
Springer
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
114
Voted
TAL
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We define Probabilistic Constrained W-grammars (PCWgrammars), a two-level formalism capable of capturing grammatical frameworks used in two state of the art parsers, nam...
121
Voted
NIPS
2004
15 years 4 months ago
2004
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
140
Voted
SIROCCO
1997
15 years 4 months ago
1997
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...
125
Voted
RSA
2000
15 years 3 months ago
2000
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the...