731 search results - page 87 / 147 » Reductions to Graph Isomorphism |
JUCS
2006
13 years 8 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
CVPR
2007
IEEE
14 years 3 months ago
2007
IEEE
We present the Conformal Embedding Analysis (CEA) for feature extraction and dimensionality reduction. Incorporating both conformal mapping and discriminating analysis, CEA projec...
FSTTCS
1994
Springer
14 years 9 days ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
ICASSP
2011
IEEE
13 years 15 days ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...