Sciweavers

600 search results - page 32 / 120
» Problems and results in extremal combinatorics - II
Sort
View
APPML
2002
76views more  APPML 2002»
13 years 7 months ago
Proper gromov transforms of metrics are metrics
In phylogenetic analysis, a standard problem is to approximate a given metric by an additive metric. Here it is shown that, given a metric D defined on some finite set X and a non...
Andreas W. M. Dress
ECAI
2006
Springer
13 years 11 months ago
Phonetic Spelling and Heuristic Search
Abstract. We introduce a new approach to spellchecking for languages with extreme phonetic irregularities. The spelling for such languages can be significantly improved if knowledg...
Benno Stein, Daniel Curatolo
CPM
2010
Springer
120views Combinatorics» more  CPM 2010»
14 years 24 days ago
Mod/Resc Parsimony Inference
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Eng...
SDM
2012
SIAM
247views Data Mining» more  SDM 2012»
11 years 10 months ago
Simplex Distributions for Embedding Data Matrices over Time
Early stress recognition is of great relevance in precision plant protection. Pre-symptomatic water stress detection is of particular interest, ultimately helping to meet the chal...
Kristian Kersting, Mirwaes Wahabzada, Christoph R&...
EMMCVPR
2005
Springer
14 years 1 months ago
Increasing Efficiency of SVM by Adaptively Penalizing Outliers
In this paper, a novel training method is proposed to increase the classification efficiency of support vector machine (SVM). The efficiency of the SVM is determined by the number ...
Yiqiang Zhan, Dinggang Shen