Sciweavers

2424 search results - page 110 / 485
» A general algorithm for data dependence analysis
Sort
View
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 6 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
EGH
2004
Springer
15 years 7 months ago
Understanding the efficiency of GPU algorithms for matrix-matrix multiplication
Utilizing graphics hardware for general purpose numerical computations has become a topic of considerable interest. The implementation of streaming algorithms, typified by highly ...
Kayvon Fatahalian, Jeremy Sugerman, Pat Hanrahan
TSP
2008
146views more  TSP 2008»
15 years 3 months ago
Improved M-FOCUSS Algorithm With Overlapping Blocks for Locally Smooth Sparse Signals
Abstract-- The FOCal Underdetermined System Solver (FOCUSS) algorithm has already found many applications in signal processing and data analysis, whereas the regularized MFOCUSS al...
Rafal Zdunek, Andrzej Cichocki
128
Voted
CGO
2006
IEEE
15 years 9 months ago
Compiler-directed Data Partitioning for Multicluster Processors
Multicluster architectures overcome the scaling problem of centralized resources by distributing the datapath, register file, and memory subsystem across multiple clusters connec...
Michael L. Chu, Scott A. Mahlke
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 3 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb