Sciweavers

1802 search results - page 314 / 361
» Complexity Theory for Operators in Analysis
Sort
View
VLSID
1998
IEEE
116views VLSI» more  VLSID 1998»
15 years 10 months ago
Synthesis of Testable RTL Designs
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
C. P. Ravikumar, Sumit Gupta, Akshay Jajoo
EMSOFT
2009
Springer
15 years 10 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
ACMSE
2006
ACM
15 years 9 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
JSAC
2010
142views more  JSAC 2010»
15 years 24 days ago
Handling inelastic traffic in wireless sensor networks
The capabilities of sensor networking devices are increasing at a rapid pace. It is therefore not impractical to assume that future sensing operations will involve real time (inela...
Jiong Jin, Avinash Sridharan, Bhaskar Krishnamacha...
CVIU
2011
14 years 9 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...