Approximation Resistant Predicates from Pairwise Independence.
Per AustrinElchanan MosselPublished in: Computational Complexity Conference (2008)
Keyphrases
- pairwise
- multi class
- closed form
- loss function
- high order
- pairwise interactions
- matrix representation
- approximation error
- efficient computation
- conditional independence
- semi supervised
- user defined
- markov random field
- error bounds
- graph matching
- higher order
- database
- point sets
- relative error
- special case
- approximation ratio
- similarity measure
- real time