Sciweavers

9736 search results - page 50 / 1948
» How Fast Can We Compute Products
Sort
View
177
Voted
DAC
2006
ACM
15 years 6 months ago
A fast HW/SW FPGA-based thermal emulation framework for multi-processor system-on-chip
With the growing complexity in consumer embedded products and the improvements in process technology, Multi-Processor SystemOn-Chip (MPSoC) architectures have become widespread. T...
David Atienza, Pablo Garcia Del Valle, Giacomo Pac...
154
Voted
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
14 years 4 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
123
Voted
VTC
2007
IEEE
15 years 10 months ago
Mellin Transform Based Performance Analysis of FFH M-ary FSK Using Product Combining Against Partial Band Noise Jamming
— We propose a novel bit error ratio (BER) analysis technique for fast frequency hopping (FFH) assisted M-ary frequency shift keying (MFSK) using product combining (PC), when the...
Sohail Ahmed, Lie-Liang Yang, Lajos Hanzo
ESTIMEDIA
2008
Springer
15 years 6 months ago
Fast GPU-based space-time correlation for activity recognition in video sequences
Action recognition is becoming an important component of many computer vision applications such as video surveillance, video indexing and browsing. However most of the space time ...
Mahsan Rofouei, Maryam Moazeni, Majid Sarrafzadeh
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 11 months ago
Fast Set Intersection in Memory
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
Bolin Ding, Arnd Christian König