Sciweavers

2887 search results - page 115 / 578
» Name Generation and Linearity
Sort
View
TIT
2011
116views more  TIT 2011»
15 years 1 months ago
Convex Programming Upper Bounds on the Capacity of 2-D Constraints
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
Ido Tal, Ron M. Roth
IJCNLP
2005
Springer
15 years 11 months ago
Topic Tracking Based on Linguistic Features
This paper explores two linguistically motivated restrictions on the set of words used for topic tracking on newspaper articles: named entities and headline words. We assume that n...
Fumiyo Fukumoto, Yusuke Yamaji
GECCO
2004
Springer
110views Optimization» more  GECCO 2004»
15 years 11 months ago
Grammatical Constant Creation
This study examines the utility of grammatical ephemeral random constants, and conducts an analysis of the preferences of evolutionary search when a number of different grammar ba...
Ian Dempsey, Michael O'Neill, Anthony Brabazon
BMCBI
2006
106views more  BMCBI 2006»
15 years 6 months ago
Gene and protein nomenclature in public databases
Background: Frequently, several alternative names are in use for biological objects such as genes and proteins. Applications like manual literature search, automated text-mining, ...
Katrin Fundel, Ralf Zimmer
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 6 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee