Sciweavers

15375 search results - page 48 / 3075
» cans 2008
Sort
View
NAACL
2010
13 years 5 months ago
Using Entity-Based Features to Model Coherence in Student Essays
We show how the Barzilay and Lapata entitybased coherence algorithm (2008) can be applied to a new, noisy data domain
Jill Burstein, Joel R. Tetreault, Slava Andreyev
LICS
2008
IEEE
14 years 2 months ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann
WCE
2007
13 years 8 months ago
Avant-Garde Matrix Splitting for the Solution of Sparse Non-symmetric Linear Systems
A non-symmetric matrix splitting is presented for the solution of certain sparse linear systems. The author reports the comparison and the convergence performance of the previous a...
A. A. Shah
SCP
2002
119views more  SCP 2002»
13 years 7 months ago
Polymorphic subtyping in O'Haskell
O'Haskell is a programming language derived from Haskell by the addition of concurrent reactive objects and subtyping. Because Haskell already encompasses an advanced type sy...
Johan Nordlander
APPML
2008
159views more  APPML 2008»
13 years 7 months ago
The rook problem on saw-toothed chessboards
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j)...
Hon-Chan Chen, Ting-Yem Ho