3466 search results - page 555 / 694 » Fast computation of special resultants |
172
click to vote
COLING
1992
15 years 7 months ago
1992
An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Normat Form (GNF) for...
199
click to vote
TREC
2007
15 years 7 months ago
2007
This paper reports on Lymba Corporation’s (a spinoff of Language Computer Corporation) participation in the TREC 2007 Question Answering track. An overview of the PowerAnswer 4 ...
186
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
160
click to vote
AIPS
2010
15 years 6 months ago
2010
In this paper, we develop a heuristic, progression based conformant planner, called CNF, which represents belief states by a special type of CNF formulae, called CNF-states. We de...
169
click to vote
ADCM
2008
15 years 6 months ago
2008
Abstract. Signals with finite rate of innovation are those signals having finite degrees of freedom per unit of time that specify them. In this paper, we introduce a prototypical s...