Sciweavers

7758 search results - page 100 / 1552
» On the Number of Distributive Lattices
Sort
View
GLOBECOM
2008
IEEE
14 years 4 months ago
Low-Complexity Maximum Likelihood Detection of Orthogonal Space-Time Block Codes
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
Luay Azzam, Ender Ayanoglu
CASES
2006
ACM
14 years 4 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner
CC
2004
Springer
115views System Software» more  CC 2004»
14 years 3 months ago
Periodic Polyhedra
This paper presents a new method for computing the integer hull of a parameterized rational polyhedron by introducing the concept of periodic polyhedron. Besides concerning general...
Benoît Meister
ASPLOS
1992
ACM
14 years 2 months ago
Access Normalization: Loop Restructuring for NUMA Compilers
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...
Wei Li, Keshav Pingali
DGCI
2006
Springer
14 years 1 months ago
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
Kees Joost Batenburg