Sciweavers

9736 search results - page 71 / 1948
» How Fast Can We Compute Products
Sort
View
ICMCS
2008
IEEE
208views Multimedia» more  ICMCS 2008»
15 years 11 months ago
Fast computation of general Fourier Transforms on GPUS
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
Brandon Lloyd, Chas Boyd, Naga K. Govindaraju
ACMDIS
2004
ACM
15 years 10 months ago
Understanding experience in interactive systems
Understanding experience is a critical issue for a variety of professions, especially design. To understand experience and the user experience that results from interacting with p...
Jodi Forlizzi, Katja Battarbee
ICPPW
2009
IEEE
15 years 11 months ago
Fast Autotuning Configurations of Parameters in Distributed Computing Systems Using Ordinal Optimization
Conventional autotuning configuration of parameters in distributed computing systems using evolutionary strategies increases integrated performance notably, though at the expense ...
Fan Zhang, Junwei Cao, Lianchen Liu, Cheng Wu
CLUSTER
2003
IEEE
15 years 10 months ago
Interstitial Computing: Utilizing Spare Cycles on Supercomputers
This paper presents an analysis of utilizing unused cycles on supercomputers through the use of many small jobs. What we call “interstitial computing,” is important to superco...
Stephen D. Kleban, Scott H. Clearwater
INFOCOM
2008
IEEE
15 years 11 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu