Sciweavers

836 search results - page 44 / 168
» On the Complexity of Train Assignment Problems
Sort
View
COLING
2008
15 years 5 months ago
What's the Date? High Accuracy Interpretation of Weekday Names
In this paper we present a study on the interpretation of weekday names in texts. Our algorithm for assigning a date to a weekday name achieves 95.91% accuracy on a test data set ...
Pawel P. Mazur, Robert Dale
JAIR
2006
87views more  JAIR 2006»
15 years 3 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
ICPR
2004
IEEE
16 years 4 months ago
Relaxation Labeling Processes for Protein Secondary Structure Prediction
The prediction of protein secondary structure is a classical problem in bioinformatics, and in the past few years several machine learning techniques have been proposed to t. From...
Giacomo Colle, Marcello Pelillo
144
Voted
GECCO
2003
Springer
117views Optimization» more  GECCO 2003»
15 years 9 months ago
Improving Evolvability of Genetic Parallel Programming Using Dynamic Sample Weighting
Abstract. This paper investigates the sample weighting effect on Genetic Parallel Programming (GPP) that evolves parallel programs to solve the training samples captured directly f...
Sin Man Cheang, Kin-Hong Lee, Kwong-Sak Leung
ACL
2007
15 years 5 months ago
Chinese Segmentation with a Word-Based Perceptron Algorithm
Standard approaches to Chinese word segmentation treat the problem as a tagging task, assigning labels to the characters in the sequence indicating whether the character marks a w...
Yue Zhang 0004, Stephen Clark