3690 search results - page 373 / 738 » Computation with classical sequents |
136
Voted
COLING
2002
15 years 6 months ago
2002
We describe a discovery program, called UNIVAUTO (UNIVersals AUthoringTOol), whose domain of application is the study of language universals, a classic trend in contemporary lingu...
184
Voted
ENTCS
2002
15 years 6 months ago
2002
This paper extends the well-known technique of slicing to synchronous reactive programs. Synchronous languages exemplified by Esterel, Lustre, Signal and Argos, novel model of exe...
160
click to vote
ECCC
1998
15 years 6 months ago
1998
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
201
click to vote
IVC
2002
15 years 6 months ago
2002
In this paper we address the problem of producing an enlarged picture from a given digital image (zooming). We propose a method that tries to take into account information about d...
197
Voted
COMBINATORICS
1999
15 years 6 months ago
1999
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...