4377 search results - page 334 / 876 » Mass problems and randomness |
167
Voted
ACL
1994
15 years 8 months ago
1994
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
173
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The problem of guessing a random string is revisited and some prior results on guessing exponents are re-derived using the theory of large deviations. It is shown that if the seque...
197
click to vote
EOR
2010
15 years 6 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
166
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...