Sciweavers

836 search results - page 26 / 168
» On the Complexity of Train Assignment Problems
Sort
View
MSE
1999
IEEE
118views Hardware» more  MSE 1999»
15 years 8 months ago
Training IP Creators and Integrators
Intellectual property IP blocks are being created for reuse and marketed as a means of reducing the development time of complex designs. This in turn leads to a reduction in time ...
Donald W. Bouldin, Senthil Natarajan, Benjamin A. ...
165
Voted
TNN
2008
97views more  TNN 2008»
15 years 3 months ago
Training Hard-Margin Support Vector Machines Using Greedy Stagewise Algorithm
Hard-margin support vector machines (HM-SVMs) suffer from getting overfitting in the presence of noise. Soft-margin SVMs deal with this problem by introducing a regularization term...
Liefeng Bo, Ling Wang, Licheng Jiao
129
Voted
RECOMB
2007
Springer
16 years 4 months ago
Support Vector Training of Protein Alignment Models
Abstract. Sequence to structure alignment is an important step in homology modeling of protein structures. Incorporation of features like secondary structure, solvent accessibility...
Chun-Nam John Yu, Thorsten Joachims, Ron Elber, Ja...
107
Voted
ANLP
1994
80views more  ANLP 1994»
15 years 5 months ago
Improving Language Models by Clustering Training Sentences
Many of the kinds of language model used in speech understanding suffer from imperfect modeling of intra-sentential contextual influences. I argue that this problem can be address...
David M. Carter
144
Voted
CIE
2007
Springer
15 years 9 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer