1510 search results - page 180 / 302 » Upper Probabilities and Additivity |
134
click to vote
NLPRS
2001
Springer
15 years 8 months ago
2001
Springer
This paper describes a method of extracting katakana words and phrases, along with their English counterparts from non-aligned monolingual web search engine query logs. The method...
130
click to vote
ICML
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
134
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
113
click to vote
EDBTW
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite dom...
146
click to vote
FSE
2006
Springer
15 years 8 months ago
2006
Springer
This is the first article analyzing the security of SHA-256 against fast collision search which considers the recent attacks by Wang et al. We show the limits of applying technique...