Sciweavers

1730 search results - page 25 / 346
» Algebra and Computation
Sort
View
JSC
2007
79views more  JSC 2007»
13 years 7 months ago
Computation of bases of free modules over the Weyl algebras
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
Alban Quadrat, Daniel Robertz
SAMOS
2010
Springer
13 years 6 months ago
Accelerating high-level engineering computations by automatic compilation of Geometric Algebra to hardware accelerators
Abstract—Geometric Algebra (GA), a generalization of quaternions, is a very powerful form for intuitively expressing and manipulating complex geometric relationships common to en...
Jens Huthmann, Peter Muller, Florian Stock, Dietma...
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
VLDB
1993
ACM
116views Database» more  VLDB 1993»
13 years 11 months ago
Algebraic Optimization of Computations over Scientific Databases
Although scientific data analysis increasingly requires accessandmanipulation of large quantitiesof data,current databasetechnology fails to meet the needsof scientific processing...
Richard H. Wolniewicz, Goetz Graefe
APAL
2002
77views more  APAL 2002»
13 years 7 months ago
Degree spectra and computable dimensions in algebraic structures
Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classe...
Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richar...