Sciweavers

66 search results - page 1 / 14
» An Optimal Tabular Parsing Algorithm
Sort
View
ACL
1994
13 years 6 months ago
An Optimal Tabular Parsing Algorithm
In this paper we relate a number of parsing algorithms which have been developed in very different areas of parsing theory, and which include deterministic algorithms, tabular alg...
Mark-Jan Nederhof
GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 4 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
FPL
2001
Springer
101views Hardware» more  FPL 2001»
13 years 9 months ago
An FPGA-Based Syntactic Parser for Real-Life Almost Unrestricted Context-Free Grammars
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by almost unrestricted real-life context-free grammars (CFGs). More prec...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...
CP
2008
Springer
13 years 6 months ago
Optimization of Simple Tabular Reduction for Table Constraints
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
Christophe Lecoutre
JMLR
2010
125views more  JMLR 2010»
12 years 11 months ago
Variational Relevance Vector Machine for Tabular Data
We adopt the Relevance Vector Machine (RVM) framework to handle cases of tablestructured data such as image blocks and image descriptors. This is achieved by coupling the regulari...
Dmitry Kropotov, Dmitry Vetrov, Lior Wolf, Tal Has...