8669 search results - page 410 / 1734 » Computing matrix representations |
198
click to vote
CONIELECOMP
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we present a set of formulations that describe some properties of the configurations that can represent the n-Dimensional Orthogonal PseudoPolytopes. Moreover, we de...
152
click to vote
COLING
1996
15 years 8 months ago
1996
In this paper we analyse the problem of generating referring expressions in a multilingnal generation system that produces instructions on how to fill out pension forms. The model...
191
click to vote
IJCAI
1993
15 years 8 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
169
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
252
click to vote
LPNMR
2011
Springer
14 years 9 months ago
2011
Springer
Over the last 25 years there has been considerable body of research into combinations of predicate logic and probability forming what has become known as (perhaps misleadingly) sta...