Sciweavers

10493 search results - page 101 / 2099
» Dynamic Word Problems
Sort
View
BMCBI
2006
151views more  BMCBI 2006»
13 years 8 months ago
Machine learning and word sense disambiguation in the biomedical domain: design and evaluation issues
Background: Word sense disambiguation (WSD) is critical in the biomedical domain for improving the precision of natural language processing (NLP), text mining, and information ret...
Hua Xu, Marianthi Markatou, Rositsa Dimova, Hongfa...
MP
2006
120views more  MP 2006»
13 years 8 months ago
Lot-sizing with production and delivery time windows
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
Laurence A. Wolsey
RECOMB
2002
Springer
14 years 8 months ago
Monotony of surprise and large-scale quest for unusual words
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
Alberto Apostolico, Mary Ellen Bock, Stefano Lonar...
SIGIR
2005
ACM
14 years 1 months ago
Boosted decision trees for word recognition in handwritten document retrieval
Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon ...
Nicholas R. Howe, Toni M. Rath, R. Manmatha
MFCS
2009
Springer
14 years 2 months ago
Bounds on Non-surjective Cellular Automata
Abstract. Cellular automata (CA) are discrete, homogeneous dynamical systems. Non-surjective one-dimensional CA have nite words with no preimage (called orphans), pairs of dieren...
Jarkko Kari, Pascal Vanier, Thomas Zeume