Sciweavers

3270 search results - page 80 / 654
» Approximate String Processing
Sort
View
LOGCOM
2007
89views more  LOGCOM 2007»
13 years 8 months ago
Anytime Approximations of Classical Logic from Above
In this paper we present s1, a family of logics that is useful to disprove propositional formulas by means of an anytime approximation process. The systems follows the paradigm of...
Marcelo Finger, Renata Wassermann
CSL
2006
Springer
14 years 20 days ago
Weak Bisimulation Approximants
Abstract. Bisimilarity and weak bisimilarity are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached
Will Harwood, Faron Moller, Anton Setzer
IJFCS
2007
109views more  IJFCS 2007»
13 years 9 months ago
Computational Power of intramolecular gene Assembly
The process of gene assembly in ciliates, an ancient group of organisms, is one of the most complex instances of DNA manipulation known in any organism. Three molecular operations...
Tseren-Onolt Ishdorj, Ion Petre, Vladimir Rogojin
EMNLP
2010
13 years 7 months ago
Modeling Organization in Student Essays
Automated essay scoring is one of the most important educational applications of natural language processing. Recently, researchers have begun exploring methods of scoring essays ...
Isaac Persing, Alan Davis, Vincent Ng