Sciweavers

2127 search results - page 80 / 426
» Computing large matchings fast
Sort
View
119
Voted
CEC
2007
IEEE
15 years 10 months ago
Memetic algorithms for inexact graph matching
—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...
Thomas Bärecke, Marcin Detyniecki
149
Voted
GCB
2008
Springer
174views Biometrics» more  GCB 2008»
15 years 4 months ago
Lightweight Comparison of RNAs based on Exact Sequence-structure Matches
: Specific functions of RNA molecules are often associated with different motifs in the RNA structure. The key feature that forms such an RNA motif is the combination of sequence ...
Steffen Heyne, Sebastian Will, Michael Beckstette,...
CVIU
2008
82views more  CVIU 2008»
15 years 3 months ago
Shape matching and registration by data-driven EM
In this paper, we present an efficient and robust algorithm for shape matching, registration, and detection. The task is to geometrically transform a source shape to fit a target ...
Zhuowen Tu, Songfeng Zheng, Alan L. Yuille
116
Voted
JETAI
2007
141views more  JETAI 2007»
15 years 3 months ago
Exchange market for complex commodities: search for optimal matches
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
Eugene Fink, Jianli Gong, Josh Johnson
129
Voted
JMLR
2010
126views more  JMLR 2010»
14 years 10 months ago
Ultra-high Dimensional Multiple Output Learning With Simultaneous Orthogonal Matching Pursuit: Screening Approach
We propose a novel application of the Simultaneous Orthogonal Matching Pursuit (SOMP) procedure to perform variable selection in ultra-high dimensional multiple output regression ...
Mladen Kolar, Eric P. Xing