373 search results - page 25 / 75 » An ACO Algorithm for the Most Probable Explanation Problem |
ESA
2007
Springer
13 years 12 months ago
2007
Springer
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Compressed sensing, an emerging multidisciplinary field involving mathematics, probability, optimization, and signal processing, focuses on reconstructing an unknown signal from a...
COMGEO
1999
ACM
13 years 7 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
MSWIM
2006
ACM
14 years 2 months ago
2006
ACM
A neural network based clustering method for the analysis of soft handovers in 3G network is introduced. The method is highly visual and it could be utilized in explorative analys...
UAI
2004
13 years 9 months ago
2004
Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesi...