362 search results - page 43 / 73 » Formal Theories for Linear Algebra |
182
click to vote
TPHOL
2005
IEEE
15 years 11 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
142
Voted
EACL
1989
ACL Anthology
15 years 7 months ago
1989
ACL Anthology
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
196
Voted
SWS
2004
ACM
15 years 11 months ago
2004
ACM
Technical advances in networks, operating systems and web based services are enabling new web-based services such as audiovisual surveillance, monitoring and recording of unfoldin...
152
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
153
click to vote
VLSID
1994
IEEE
15 years 10 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...