Sciweavers

244 search results - page 47 / 49
» Oscillating Search Algorithms for Feature Selection
Sort
View
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Electors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
Oscar Kin-Chung Au, Chiew-Lan Tai, Daniel Cohen-Or...
BMCBI
2008
173views more  BMCBI 2008»
13 years 7 months ago
Improved machine learning method for analysis of gas phase chemistry of peptides
Background: Accurate peptide identification is important to high-throughput proteomics analyses that use mass spectrometry. Search programs compare fragmentation spectra (MS/MS) o...
Allison Gehrke, Shaojun Sun, Lukasz A. Kurgan, Nat...
IPM
2007
145views more  IPM 2007»
13 years 7 months ago
Text mining techniques for patent analysis
Patent documents contain important research results. However, they are lengthy and rich in technical terminology such that it takes a lot of human efforts for analyses. Automatic...
Yuen-Hsien Tseng, Chi-Jen Lin, Yu-I Lin
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
13 years 11 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
HIS
2007
13 years 9 months ago
Pareto-based Multi-Objective Machine Learning
—Machine learning is inherently a multiobjective task. Traditionally, however, either only one of the objectives is adopted as the cost function or multiple objectives are aggreg...
Yaochu Jin