Sciweavers

1542 search results - page 271 / 309
» A compressive beamforming method
Sort
View
DCC
2007
IEEE
14 years 10 months ago
Bounds on Redundancy in Constrained Delay Arithmetic Coding
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
Ofer Shayevitz, Eado Meron, Meir Feder, Ram Zamir
DCC
2006
IEEE
14 years 10 months ago
Non-Asymptotic Design of Finite State Universal Predictors for Individual Sequences
In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relativel...
Amir Ingber, Meir Feder
DCC
2004
IEEE
14 years 10 months ago
Predicting Wavelet Coefficients Over Edges Using Estimates Based on Nonlinear Approximants
It is well-known that wavelet transforms provide sparse decompositions over many types of image regions but not over image singularities/edges that manifest themselves along curve...
Onur G. Guleryuz
ICCAD
2004
IEEE
101views Hardware» more  ICCAD 2004»
14 years 7 months ago
Frugal linear network-based test decompression for drastic test cost reductions
— In this paper we investigate an effective approach to construct a linear decompression network in the multiple scan chain architecture. A minimal pin architecture, complemented...
Wenjing Rao, Alex Orailoglu, G. Su
TCC
2010
Springer
381views Cryptology» more  TCC 2010»
14 years 7 months ago
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
We construct a fully secure HIBE scheme with short ciphertexts. The previous construction of Boneh, Boyen, and Goh was only proven to be secure in the selective model, under a non...
Allison B. Lewko, Brent Waters