Sciweavers

51 search results - page 6 / 11
» Orthogonal Persistence Revisited
Sort
View
TIT
2010
171views Education» more  TIT 2010»
13 years 2 months ago
Analysis of orthogonal matching pursuit using the restricted isometry property
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...
Mark A. Davenport, Michael B. Wakin
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 7 months ago
A Peer-to-Peer Middleware Framework for Resilient Persistent Programming
The persistent programming systems of the 1980s offered a programming model that integrated computation and long-term storage. In these systems, reliable applications could be eng...
Alan Dearle, Graham N. C. Kirby, Stuart J. Norcros...
ICDCS
1996
IEEE
13 years 11 months ago
Larchant: Persistence by Reachability in Distributed Shared Memory Through Garbage Collection
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This ...
Paulo Ferreira, Marc Shapiro
ISCA
2007
IEEE
94views Hardware» more  ISCA 2007»
13 years 7 months ago
Tailoring quantum architectures to implementation style: a quantum computer for mobile and persistent qubits
In recent years, quantum computing (QC) research has moved from the realm of theoretical physics and mathematics into real implementations [9]. With many different potential hardw...
Eric Chi, Stephen A. Lyon, Margaret Martonosi
VTC
2008
IEEE
146views Communications» more  VTC 2008»
14 years 1 months ago
How Typical is the "Typical Urban" channel model?
— Channel models for urban deployments are among the most commonly used in research, standardization, and dimensioning of cellular networks. The time dispersion has ever been an ...
Henrik Asplund, Kjell Larsson, Peter Ökvist