Sciweavers

785 search results - page 4 / 157
» An Algebra of Hierarchical Graphs
Sort
View
COMBINATORICS
2007
87views more  COMBINATORICS 2007»
13 years 7 months ago
Recognizing Cluster Algebras of Finite Type
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
Ahmet I. Seven
COMBINATORICS
1999
82views more  COMBINATORICS 1999»
13 years 7 months ago
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
Sergei Evdokimov, Ilia N. Ponomarenko
EUROMICRO
1996
IEEE
13 years 11 months ago
A Graph Rewriting Approach for Transformational Design of Digital Systems
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
Corrie Huijs
ECCV
1994
Springer
14 years 9 months ago
On the Enumerative Geometry of Aspect Graphs
Most of the work achieved thus far on aspect graphs has concentrated on the design of algorithms for computing the representation. After reviewing how the space of viewpoints can b...
Sylvain Petitjean
PPAM
2005
Springer
14 years 28 days ago
Adapting Linear Algebra Codes to the Memory Hierarchy Using a Hypermatrix Scheme
Abstract. We present the way in which we adapt data and computations to the underlying memory hierarchy by means of a hierarchical data structure known as hypermatrix. The applicat...
José R. Herrero, Juan J. Navarro