220 search results - page 19 / 44 » Reconstruction Algorithm for Permutation Graphs |
HLK
2003
IEEE
14 years 27 days ago
2003
IEEE
It’s common experience for human vision to perceive full 3D shape and scene from a single 2D image with the occluded parts “filled-in” by prior visual knowledge. In this pa...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
NIPS
2004
13 years 9 months ago
2004
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
CASC
2007
Springer
14 years 1 months ago
2007
Springer
For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. ...