3495 search results - page 78 / 699 » On the random satisfiable process |
76
Voted
ICIP
2008
IEEE
15 years 7 months ago
2008
IEEE
We consider the problem of establishing visual correspondences in a distributed and rate-efficient fashion by broadcasting compact descriptors. Establishing visual correspondence...
ICIP
2007
IEEE
15 years 7 months ago
2007
IEEE
A new method for lossy compression of bilevel images based on Markov random fields (MRFs) is proposed. It preserves key structural information about the image, and then reconstru...
129
Voted
ECML
2006
Springer
15 years 4 months ago
2006
Springer
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
111
Voted
NIPS
2008
15 years 2 months ago
2008
Compressive Sensing (CS) combines sampling and compression into a single subNyquist linear measurement process for sparse and compressible signals. In this paper, we extend the th...
71
Voted
EACL
2006
ACL Anthology
15 years 2 months ago
2006
ACL Anthology
In this paper, we present an automated, quantitative, knowledge-poor method to evaluate the randomness of a collection of documents (corpus), with respect to a number of biased pa...