2184 search results - page 256 / 437 » Relative Entropy and Statistics |
134
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
165
click to vote
UAI
2008
15 years 5 months ago
2008
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...
131
click to vote
ACL
2006
15 years 5 months ago
2006
We investigate generalizations of the allsubtrees "DOP" approach to unsupervised parsing. Unsupervised DOP models assign all possible binary trees to a set of sentences ...
139
Voted
AVI
2006
15 years 5 months ago
2006
This paper presents an analysis of user studies from a review of papers describing new visualisation applications and uses these to highlight various issues related to the evaluat...
127
Voted
DLT
2004
15 years 5 months ago
2004
We study the maximum function of any R+-rational formal series S in two commuting variables, which assigns to every integer n N, the maximum coefficient of the monomials of degree...