Sciweavers

4007 search results - page 384 / 802
» Computation with imprecise probabilities
Sort
View
NAACL
2010
15 years 4 months ago
Products of Random Latent Variable Grammars
We show that the automatically induced latent variable grammars of Petrov et al. (2006) vary widely in their underlying representations, depending on their EM initialization point...
Slav Petrov
NAACL
2010
15 years 4 months ago
Quantifying the Limits and Success of Extractive Summarization Systems Across Domains
This paper analyzes the topic identification stage of single-document automatic text summarization across four different domains, consisting of newswire, literary, scientific and ...
Hakan Ceylan, Rada Mihalcea, Umut O'zertem, Elena ...
182
Voted
SOFSEM
2010
Springer
15 years 4 months ago
Fast and Compact Prefix Codes
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
Travis Gagie, Gonzalo Navarro, Yakov Nekrich
WIOPT
2010
IEEE
15 years 4 months ago
Virtual MIMO network a physical wireless analysis
By analogy with an approach widely used in physics, we consider a discrete set of base stations (BS) as a continuum of transmitters. This model allows us to establish a simple clos...
Jean Marc Kelif
ACL
2009
15 years 4 months ago
Confidence Measure for Word Alignment
In this paper we present a confidence measure for word alignment based on the posterior probability of alignment links. We introduce sentence alignment confidence measure and alig...
Fei Huang