61 search results - page 10 / 13 » Probable Innocence Revisited |
JMLR
2010
13 years 2 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
In object recognition, soft-assignment coding enjoys computational efficiency and conceptual simplicity. However, its classification performance is inferior to the newly develop...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper revisits the problem of detecting greedy behavior in the IEEE 802.11 MAC protocol by evaluating the performance of two previously proposed schemes: DOMINO and the Se...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
MLG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...