1153 search results - page 132 / 231 » Reversing graph transformations |
123
Voted
PR
2007
15 years 5 days ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
103
Voted
PPDP
2009
Springer
15 years 7 months ago
2009
Springer
This paper describes the design goals and current status of tidier, a software tool that tidies Erlang source code, making it cleaner, simpler, and often also more efficient. In ...
122
Voted
WCC
2005
Springer
15 years 6 months ago
2005
Springer
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
115
click to vote
AVBPA
2003
Springer
15 years 5 months ago
2003
Springer
In this paper a completely automatic face recognition system is presented. The system is inspired by the elastic bunch graph method, but the fiducial point localization is complet...
90
Voted
COMBINATORICS
2006
15 years 21 days ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...