5606 search results - page 444 / 1122 » Randomization Techniques for Graphs. |
158
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...
141
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
PageRank is the best known technique for link-based importance ranking. The computed importance scores, however, are not directly comparable across different snapshots of an evolv...
161
click to vote
FLOPS
2010
Springer
16 years 1 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
190
click to vote
COCOON
2007
Springer
16 years 28 days ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
185
click to vote
LOPSTR
2007
Springer
16 years 27 days ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...