1018 search results - page 181 / 204 » Learning Probabilistic Models of Contours |
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
102
click to vote
PODS
2008
ACM
15 years 10 months ago
2008
ACM
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Many perception and multimedia indexing problems involve datasets that are naturally comprised of multiple streams or modalities for which supervised training data is only sparsely...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Unsupervised over-segmentation of an image into superpixels
is a common preprocessing step for image parsing
algorithms. Superpixels are used as both regions of support
for feat...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...