1696 search results - page 28 / 340 » Permuted function matching |
AAAI
2012
13 years 11 days ago
2012
In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distri...
101
click to vote
CPM
2004
Springer
15 years 3 months ago
2004
Springer
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
ACISP
1999
Springer
15 years 2 months ago
1999
Springer
We use combinatorial methods and permutation groups to classify homogeneous boolean functions. The property of symmetry of a boolean function limits the size of the function’s cl...