Sciweavers

2066 search results - page 177 / 414
» Word Maturity: Computational Modeling of Word Knowledge
Sort
View
82
Voted
NIPS
1996
14 years 11 months ago
Combining Neural Networks and Context-Driven Search for On-Line, Printed Handwriting Recognition in the Newton
While on-line handwriting recognition is an area of long-standing and ongoing research, the recent emergence of portable, pen-based computers has focused urgent attention on usabl...
Larry S. Yaeger, Brandyn J. Webb, Richard F. Lyon
AUTOMATICA
2008
94views more  AUTOMATICA 2008»
14 years 10 months ago
Reachability analysis of continuous-time piecewise affine systems
This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set o...
Abdullah Hamadeh, Jorge Goncalves
IJCGA
2006
85views more  IJCGA 2006»
14 years 10 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
NAACL
2010
14 years 8 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...
NAACL
2010
14 years 8 months ago
An extractive supervised two-stage method for sentence compression
We present a new method that compresses sentences by removing words. In a first stage, it generates candidate compressions by removing branches from the source sentence's dep...
Dimitrios Galanis, Ion Androutsopoulos