Sciweavers

7 search results - page 1 / 2
» Computation of bases of free modules over the Weyl algebras
Sort
View
JSC
2007
79views more  JSC 2007»
13 years 5 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
LICS
2008
IEEE
13 years 11 months ago
A Logic for Algebraic Effects
We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the a-calculus, a minimal calcu...
Gordon D. Plotkin, Matija Pretnar
MOBICOM
2010
ACM
13 years 5 months ago
Side channel: bits over interference
Interference is a critical issue in wireless communications. In a typical multiple-user environment, different users may severely interfere with each other. Coordination among use...
Kaishun Wu, Haoyu Tan, Yunhuai Liu, Jin Zhang, Qia...
BMCBI
2011
12 years 8 months ago
Conotoxin Protein Classification Using Free Scores of Words and Support Vector Machines
Background: Conotoxin has been proven to be effective in drug design and could be used to treat various disorders such as schizophrenia, neuromuscular disorders and chronic pain. ...
Nazar Zaki, Stefan Wolfsheimer, Grégory Nue...
CADE
1998
Springer
13 years 9 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary