Sciweavers

609 search results - page 28 / 122
» Comparing Similarity Combination Methods for Schema Matching
Sort
View
DATE
1999
IEEE
101views Hardware» more  DATE 1999»
14 years 29 days ago
Polynomial Methods for Allocating Complex Components
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
James Smith, Giovanni De Micheli
AAAI
2012
11 years 11 months ago
Convex Matching Pursuit for Large-Scale Sparse Coding and Subset Selection
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
Mingkui Tan, Ivor W. Tsang, Li Wang, Xinming Zhang
BMCBI
2007
102views more  BMCBI 2007»
13 years 8 months ago
A comprehensive system for evaluation of remote sequence similarity detection
Background: Accurate and sensitive performance evaluation is crucial for both effective development of better structure prediction methods based on sequence similarity, and for th...
Yuan Qi, Ruslan Sadreyev, Yong Wang, Bong-Hyun Kim...
IDA
2007
Springer
14 years 2 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
PAMI
2008
152views more  PAMI 2008»
13 years 8 months ago
Class-Based Feature Matching Across Unrestricted Transformations
We develop a novel method for class-based feature matching across large changes in viewing conditions. The method (called MBE) is based on the property that when objects share a si...
Evgeniy Bart, Shimon Ullman