Sciweavers

911 search results - page 15 / 183
» First Steps with a Rideable Computer
Sort
View
ECAI
1992
Springer
15 years 9 months ago
A Strategy for the Computation of Conditional Answers
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
Robert Demolombe
DLT
2008
15 years 6 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
FLAIRS
2010
15 years 7 months ago
Towards A Computational Assessment of Freewriting Quality
This study examines the linguistic features of freewrites and how those features relate to human scores of freewrite quality. Freewriting is a common prewriting strategy that has ...
Jennifer L. Weston, Scott A. Crossley, Danielle S....
PROCEDIA
2010
154views more  PROCEDIA 2010»
14 years 11 months ago
Parallel computation of phylogenetic consensus trees
The field of bioinformatics is witnessing a rapid and overwhelming accumulation of molecular sequence data, predominantly driven by novel wet-lab sequencing techniques. This trend...
Andre J. Aberer, Nicholas D. Pattengale, Alexandro...
AAAI
2008
15 years 7 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...