Sciweavers

8337 search results - page 1664 / 1668
» Reasoning With Characteristic Models
Sort
View
TSP
2010
13 years 1 months ago
Compressed sensing performance bounds under Poisson noise
Abstract--This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative ...
Maxim Raginsky, Rebecca Willett, Zachary T. Harman...
RTAS
2011
IEEE
12 years 10 months ago
ARCH: Practical Channel Hopping for Reliable Home-Area Sensor Networks
Abstract—Home area networks (HANs) promise to enable sophisticated home automation applications such as smart energy usage and assisted living. However, recent empirical study of...
Mo Sha, Gregory Hackmann, Chenyang Lu
ASPLOS
2011
ACM
12 years 10 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
ASPLOS
2011
ACM
12 years 10 months ago
Sponge: portable stream programming on graphics engines
Graphics processing units (GPUs) provide a low cost platform for accelerating high performance computations. The introduction of new programming languages, such as CUDA and OpenCL...
Amir Hormati, Mehrzad Samadi, Mark Woh, Trevor N. ...
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 10 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
« Prev « First page 1664 / 1668 Last » Next »