Sciweavers

9736 search results - page 72 / 1948
» How Fast Can We Compute Products
Sort
View
AICCSA
2006
IEEE
168views Hardware» more  AICCSA 2006»
15 years 10 months ago
Power Efficient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a veh...
Turkmen Canli, Ajay K. Gupta, Ashfaq A. Khokhar
MICCAI
2009
Springer
16 years 5 months ago
A Fast Alternative to Computational Fluid Dynamics for High Quality Imaging of Blood Flow
Obtaining detailed, patient-specific blood flow information would be very useful in detecting and monitoring cardio-vascular diseases. Current approaches rely on computational flui...
Robert H. P. McGregor, Dominik Szczerba, Krishnamu...
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
15 years 9 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
EC
2011
240views ECommerce» more  EC 2011»
14 years 11 months ago
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
Johannes Bader, Eckart Zitzler
HPDC
2010
IEEE
15 years 5 months ago
Detouring and replication for fast and reliable internet-scale stream processing
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
Christopher McConnell, Fan Ping, Jeong-Hyon Hwang