Results 1  10
of
534
For Most Large Underdetermined Systems of Linear Equations the Minimal ℓ1norm Solution is also the Sparsest Solution
 Comm. Pure Appl. Math
, 2004
"... We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so that ..."
Abstract

Cited by 568 (10 self)
 Add to MetaCart
. In contrast, heuristic attempts to sparsely solve such systems – greedy algorithms and thresholding – perform poorly in this challenging setting. The techniques include the use of random proportional embeddings and almostspherical sections in Banach space theory, and deviation bounds for the eigenvalues
Combinatorial model and bounds for target set selection
 THEOR. COMPUT. SCI
, 2010
"... The adoption of everyday decisions in public affairs, fashion, moviegoing, and consumer behavior is now thoroughly believed to migrate in a population through an influential network. The same diffusion process when being imitated by intention is called viral marketing. This process can be modeled b ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
by a (directed) graph G = (V, E) with a threshold t(v) for every vertex v ∈ V, where v becomes active once at least t(v) of its (in)neighbors are already active. A Perfect Target Set is a set of vertices whose activation will eventually activate the entire graph, and the Perfect Target Set Selection
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
, samples of distinct information content can be obtained at one time by using distinct receivers in parallel (2), implying the possibility of reducing scan time in Fourier imaging without having to travel faster in kspace. In 1988 Hutchinson and Raff (3) suggested dispensing entirely with phase encoding
An Algorithm for Influence Maximization and Target Set Selection for the Deterministic Linear Threshold Model
, 2014
"... The problem of influence maximization has been studied extensively with applications that include viral marketing, recommendations, and feed ranking. The optimization problem, first formulated by Kempe, Kleinberg and Tardos, is known to be NPhard. Thus, several heuristics have been proposed to solv ..."
Abstract
 Add to MetaCart
. Results demonstrate that the new algorithm performs consistently better than the seven other heuristics that we evaluated in terms of final spread size. The threshold difference greedy algorithm has tuneable parameters which can make the algorithm run faster. As a part of the approach, the algorithm also
Mining compressed frequentpattern sets
 In VLDB
, 2005
"... A major challenge in frequentpattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one may generate an explosive number of output patterns, which severely restricts its usage. In this paper, we study the prob ..."
Abstract

Cited by 83 (8 self)
 Add to MetaCart
the problem of compressing frequentpattern sets. Typically, frequent patterns can be clustered with a tightness measure δ (called δcluster), and a representative pattern can be selected for each cluster. Unfortunately, finding a minimum set of representative patterns is NPHard. We develop two greedy
Optimal coresets for balls
 Comput. Geom. Theory Appl
"... Given a set of points P ⊂ Rd and value ɛ> 0, an ɛcoreset S ⊂ P has the property that the smallest ball containing S is within ɛ of the smallest ball containing P. This paper shows that any point set has an ɛcoreset of size ⌈1/ɛ⌉, and this bound is tight in the worst case. A faster algorithm g ..."
Abstract

Cited by 52 (1 self)
 Add to MetaCart
given here finds an ɛcoreset of size at most 2/ɛ. These results imply the existence of small coresets for solving approximate kcenter clustering and related problems. The sizes of these coresets are considerably smaller than the previously known bounds, and imply faster algorithms; one
Anonymous Hierarchical IdentityBased Encryption (Without Random Oracles). In: Dwork
 CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identitybased cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract

Cited by 119 (10 self)
 Add to MetaCart
Σ ∈ N in unary, and the hierarchy's maximum depth D ∈ N, the setup algorithm first generates a bilinear instance 1. Select 7 + 5 D + D 2 random integers modulo p (some of them forcibly nonzero): 2. Publish G and the system parameters Pub ∈ G T × G 2 (1+D) (2+D) given by: 3. Retain the master
Faster Ridge Regression via the Subsampled Randomized Hadamard Transform
"... We propose a fast algorithm for ridge regression when the number of features is much larger than the number of observations (p n). The standard way to solve ridge regression in this setting works in the dual space and gives a running time of O(n2p). Our algorithm Subsampled Randomized Hadamard Tran ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We propose a fast algorithm for ridge regression when the number of features is much larger than the number of observations (p n). The standard way to solve ridge regression in this setting works in the dual space and gives a running time of O(n2p). Our algorithm Subsampled Randomized Hadamard
The transport capacity of wireless networks over fading channels
, 2005
"... We consider networks consisting of nodes with radios, and without any wired infrastructure, thus necessitating all communication to take place only over the shared wireless medium. The main focus of this paper is on the effect of fading in such wireless networks. We examine the attenuation regime ..."
Abstract

Cited by 89 (4 self)
 Add to MetaCart
the first assumption set, which essentially requires only a mild time average type of bound on the fading process, we show that the transport capacity can grow no faster than (), where denotes the number of nodes, even when the channel state information (CSI) is available noncausally at both
An Improved Threshold Ring Signature Scheme Based on Error Correcting Codes
"... Abstract. The concept of threshold ring signature in codebased cryptography was introduced by Aguilar et al. in [1]. Their proposal uses Stern’s identification scheme as basis. In this paper we construct a novel threshold ring signature scheme built on the qSD identification scheme recently propos ..."
Abstract
 Add to MetaCart
proposed by Cayrel et al. in [14]. Our proposed scheme benefits of a performance gain as a result of the reduction in the soundness error from 2/3 for Stern’s scheme to 1/2 per round for the qSD scheme. Our threshold ring signature scheme uses random linear codes over the field Fq, secure in the random
Results 1  10
of
534