Sciweavers

5493 search results - page 290 / 1099
» Effectively Polynomial Simulations
Sort
View
TSP
2010
15 years 1 months ago
Sampling piecewise sinusoidal signals with finite rate of innovation methods
We consider the problem of sampling piecewise sinusoidal signals. Classical sampling theory does not enable perfect reconstruction of such signals since they are not bandlimited. ...
Jesse Berent, Pier Luigi Dragotti, Thierry Blu
ICASSP
2011
IEEE
14 years 10 months ago
Compact support kernels based time-frequency distributions: Performance evaluation
This paper presents two new time-frequency distributions based on kernels with compact support (KCS) namely the separable CB (SCB) and the polynomial CB (PCB) TFDs. The implementa...
Mansour Abed, Adel Belouchrani, Mohamed Cheriet, B...
IACR
2011
91views more  IACR 2011»
14 years 6 months ago
A Scalable Method for Constructing Galois NLFSRs with Period $2^n-1$ using Cross-Join Pairs
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
Elena Dubrova
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 11 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
DAC
2006
ACM
16 years 7 months ago
Design tools for reliability analysis
Recent progress in EDA tools allows IC designs to be accurately verified with consequent improvements in yield and performance through reduced guard bands. This paper will present...
Zhihong Liu, Bruce McGaughy, James Z. Ma