Sciweavers

5647 search results - page 137 / 1130
» A word from the editor
Sort
View
ACL
1992
15 years 7 months ago
Estimating Upper and Lower Bounds on the Performance of Word-Sense Disambiguation Programs
We have recently reported on two new word-sense disambiguation systems, one trained on bilingual material (the Canadian Hansards) and the other trained on monolingual material (Ro...
William A. Gale, Kenneth Ward Church, David Yarows...
IANDC
2008
141views more  IANDC 2008»
15 years 6 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
ICEIS
2009
IEEE
16 years 1 months ago
Creation and Maintenance of Query Expansion Rules
In an information retrieval system, a thesaurus can be used for query expansion, i.e. adding words to queries in order to improve recall. We propose a semi-automatic and interactiv...
Stefania Castellani, Aaron N. Kaplan, Fréd&...
CHI
1998
ACM
15 years 10 months ago
Scripting Graphical Applications by Demonstration
Writing scripts (often called “macros”) can be helpful for automating repetitive tasks. Scripting facilities for text editors like Emacs and Microsoft Word have been widely us...
Brad A. Myers
ICLP
2010
Springer
15 years 10 months ago
A Logical Paradigm for Systems Biology (Invited Talk)
[6]. An SBML model can be interpreted in Biocham at three abstraction levels: • the Boolean semantics (asynchronuous Boolean state transitions on the presence/absence of molecule...
François Fages