Sciweavers

68 search results - page 8 / 14
» Fast Sparse Representation with Prototypes
Sort
View
CISS
2008
IEEE
14 years 1 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
SIBGRAPI
2007
IEEE
14 years 1 months ago
A Simple Framework for Natural Animation of Digitized Models
We present a versatile, fast and simple framework to generate animations of scanned human characters from input optical motion capture data. Our method is purely meshbased and req...
Edilson de Aguiar, Rhaleb Zayer, Christian Theobal...
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...
PG
2002
IEEE
13 years 11 months ago
The Light Field Oracle
We present the light field oracle, a novel mathematical concept for the acquisition, processing and representation of light fields. We first compute a hierarchical representati...
Reto Lütolf, Bernt Schiele, Markus H. Gross
EC
1998
178views ECommerce» more  EC 1998»
13 years 6 months ago
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
Michael D. Vose, Alden H. Wright