Sciweavers

1391 search results - page 79 / 279
» Optimally Sparse Frames
Sort
View
TAMC
2007
Springer
15 years 6 months ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
CVPR
2008
IEEE
16 years 1 months 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
KDD
2009
ACM
249views Data Mining» more  KDD 2009»
16 years 12 days ago
Drosophila gene expression pattern annotation using sparse features and term-term interactions
The Drosophila gene expression pattern images document the spatial and temporal dynamics of gene expression and they are valuable tools for explicating the gene functions, interac...
Shuiwang Ji, Lei Yuan, Ying-Xin Li, Zhi-Hua Zhou, ...
EUROGRAPHICS
2010
Eurographics
15 years 9 months ago
Adding Depth to Cartoons Using Sparse Depth (In)equalities
This paper presents a novel interactive approach for adding depth information into hand-drawn cartoon images and animations. In comparison to previous depth assignment techniques ...
Daniel Sýkora, David Sedlacek, Sun Jinchao, John ...
FOCS
2009
IEEE
15 years 6 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu