65 search results - page 1 / 13 » Graph Automorphism-Based Algorithm for Determining Symmetric... |
ICCD
2004
IEEE
14 years 1 months ago
2004
IEEE
ECML
2006
Springer
13 years 8 months ago
2006
Springer
In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data points' (often symmetric) relationships in input space...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
Symmetric input identification is an important technique in logic synthesis. Previous approaches deal with this problem by building BDDs and developing algorithms to determine symm...
JCT
2006
13 years 4 months ago
2006
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...