816 search results - page 37 / 164 » Abstract Barycentric Algebras |
CC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
WADT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framewo...
DAGSTUHL
1996
13 years 9 months ago
1996
Abstract. Two-level -calculi have been heavily utilised for applications such as partial evaluation, abstract interpretation and code generation. Each of these applications pose di...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
ISPEC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we discuss the problem of collusion secure fingerprinting. In the first part of our contribution we prove the existence of equidistant codes that can be u...