Sciweavers

456 search results - page 12 / 92
» Generating high performance pruned FFT implementations
Sort
View
ESCIENCE
2007
IEEE
14 years 1 months ago
Binary Data Transfer Performance over High-Latency Networks Using Web Service Attachments
One of the objectives of e-Research is to help scientists to accomplish their research, including scientific experiments, more effectively and efficiently. Web services provide ...
Donglai Zhang, Paul D. Coddington, Andrew L. Wende...
KDD
2000
ACM
140views Data Mining» more  KDD 2000»
13 years 11 months ago
Effective Retrieval of Audio Information from Annotated Text Using Ontologies
To improve the accuracy in terms of precision and recall of an audio information retrieval system we have created a domainspecific ontology (a collection of key concepts and their...
Latifur Khan, Dennis McLeod
TMC
2010
161views more  TMC 2010»
13 years 5 months ago
High-Rate Uncorrelated Bit Extraction for Shared Secret Key Generation from Channel Measurements
—Secret keys can be generated and shared between two wireless nodes by measuring and encoding radio channel characteristics without ever revealing the secret key to an eavesdropp...
Neal Patwari, Jessica Croft, Suman Jana, Sneha Kum...
IPPS
2000
IEEE
13 years 12 months ago
Dynamic Data Layouts for Cache-Conscious Factorization of DFT
Effective utilization of cache memories is a key factor in achieving high performance in computing the Discrete Fourier Transform (DFT). Most optimizationtechniques for computing ...
Neungsoo Park, Dongsoo Kang, Kiran Bondalapati, Vi...
IPPS
2007
IEEE
14 years 1 months ago
Performance Analysis of a Family of WHT Algorithms
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
Michael Andrews, Jeremy Johnson