Sciweavers

199 search results - page 4 / 40
» Computationally and Algebraically Complex Finite Algebra Mem...
Sort
View
CASC
2006
Springer
106views Mathematics» more  CASC 2006»
14 years 1 months ago
Simplicial Perturbation Techniques and Effective Homology
In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an "elementary simplicial perturbation" process such as th...
Rocío González-Díaz, Bel&eacu...
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 9 months ago
Geometry and the complexity of matrix multiplication
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
J. M. Landsberg
CONCUR
1998
Springer
14 years 2 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 4 months ago
Left invertibility of discrete-time output-quantized systems: the linear case with finite inputs
This paper studies left invertibility of discrete-time linear output-quantized systems. Quantized outputs are generated according to a given partition of the state-space, while inp...
Nevio Dubbini, Benedetto Piccoli, Antonio Bicchi
ICCAD
2005
IEEE
160views Hardware» more  ICCAD 2005»
14 years 6 months ago
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
Namrata Shekhar, Priyank Kalla, Florian Enescu, Si...