4007 search results - page 398 / 802 » Computation with imprecise probabilities |
197
click to vote
JMLR
2008
15 years 6 months ago
2008
We consider a hierarchy of queries about causal relationships in graphical models, where each level in the hierarchy requires more detailed information than the one below. The hie...
205
click to vote
TCOS
2010
15 years 5 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
160
click to vote
ACL
2010
15 years 4 months ago
2010
We tackle the previously unaddressed problem of unsupervised determination of the optimal morphological segmentation for statistical machine translation (SMT) and propose a segmen...
213
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
222
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...