Sciweavers

534 search results - page 55 / 107
» Data Separation by Sparse Representations
Sort
View
CVPR
2008
IEEE
15 years 5 days ago
Sparsity, redundancy and optimal image support towards knowledge-based segmentation
In this paper, we propose a novel approach to model shape variations. It encodes sparsity, exploits geometric redundancy, and accounts for the different degrees of local variation...
Salma Essafi, Georg Langs, Nikos Paragios
VIS
2004
IEEE
111views Visualization» more  VIS 2004»
14 years 11 months ago
Importance-Driven Volume Rendering
This paper introduces importance-driven volume rendering as a novel technique for automatic focus and context display of volumetric data. Our technique is a generalization of cut-...
Armin Kanitsar, Eduard Gröller, Ivan Viola
PPOPP
2012
ACM
12 years 5 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
ICASSP
2010
IEEE
13 years 10 months ago
An L1 criterion for dictionary learning by subspace identification
We propose an ℓ1 criterion for dictionary learning for sparse signal representation. Instead of directly searching for the dictionary vectors, our dictionary learning approach i...
Florent Jaillet, Rémi Gribonval, Mark D. Pl...
WSC
2004
13 years 11 months ago
Automated Database and Schema-Based Data Interchange for Modeling and Simulation
Creating a simulation of a large enterprise system by manually coding all the details into a simulator tool is not just time consuming, but yields a system that is difficult to ma...
Gregory A. Harrison, David S. Maynard, Eytan Polla...