1024 search results - page 44 / 205 » The Generalized PatchMatch Correspondence Algorithm |
PR
2000
14 years 9 months ago
2000
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
KAIS
2008
14 years 9 months ago
2008
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
This work addresses selected aspects of natural evolution, especially of the field of population genetics, that are considered to be meaningful for algorithmic further development...