Sciweavers

3092 search results - page 510 / 619
» Where are you pointing
Sort
View
SIAMIS
2010
156views more  SIAMIS 2010»
13 years 3 months ago
Learning the Morphological Diversity
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...
Gabriel Peyré, Jalal Fadili, Jean-Luc Starc...
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 3 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
COMPGEOM
2011
ACM
13 years 16 days ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
IACR
2011
104views more  IACR 2011»
12 years 8 months ago
Collusion Resistant Obfuscation and Functional Re-encryption
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...
Nishanth Chandran, Melissa Chase, Vinod Vaikuntana...
INFOCOM
2012
IEEE
11 years 11 months ago
Capacity of distributed content delivery in large-scale wireless ad hoc networks
—In most existing wireless networks, end users obtain data content from the wired network, typically, the Internet. In this manner, virtually all of their traffic must go throug...
Wang Liu, Kejie Lu, Jianping Wang, Yi Qian, Tao Zh...