Sciweavers

185 search results - page 2 / 37
» Constructions of Grassmannian Simplices
Sort
View
OOPSLA
2005
Springer
14 years 4 months ago
Subtext: uncovering the simplicity of programming
Representing programs as text strings makes programming harder then it has to be. The source text of a program is far removed from its behavior. Bridging this conceptual gulf is w...
Jonathan Edwards
DCC
2001
IEEE
14 years 10 months ago
The Invariants of the Clifford Groups
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane
CASC
2010
Springer
125views Mathematics» more  CASC 2010»
13 years 9 months ago
Thomas Decomposition of Algebraic and Differential Systems
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these system into so-called simple subsystems and there...
Thomas Bächler, Vladimir P. Gerdt, Markus Lan...
IACR
2011
127views more  IACR 2011»
12 years 10 months ago
Oblivious RAM with O((log N)^3) Worst-Case Cost
Oblivious RAM (O-RAM) is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. This paper proposes...
Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Ming...
ICASSP
2008
IEEE
14 years 5 months ago
Kerdock codes for limited feedback MIMO systems
A codebook based limited feedback strategy is a practical way to obtain partial channel state information at the transmitter in a precoded multiple-input multiple-output (MIMO) wi...
Takao Inoue, Robert W. Heath Jr.