12 search results - page 2 / 3 » Analysis of graphs for digital preservation suitability |
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
In order to preserve our cultural heritage and for automated document processing libraries and national archives have started digitizing historical documents. In the case of degra...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
SIGSOFT
2003
ACM
14 years 5 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
KDD
2010
ACM
13 years 8 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...