Results 1  10
of
10
Estimating dominance norms of multiple data streams
 in Proceedings of the 11th European Symposium on Algorithms (ESA
, 2003
"... Abstract. There is much focus in the algorithms and database communities on designing tools to manage and mine data streams. Typically, data streams consist of multiple signals. Formally, a stream of multiple signals is (i, ai,j) where i’s correspond to the domain, j’s index the different signals an ..."
Abstract

Cited by 29 (8 self)
 Add to MetaCart
and ai,j ≥ 0 give the value of the jth signal at point i. We study the problem of finding norms that are cumulative of the multiple signals in the data stream. For example, consider the maxdominance norm, defined as i maxj{ai,j}. It may be thought as estimating the norm of the “upper envelope
REGULARITY OF ROOTS OF POLYNOMIALS
"... Abstract. Let Pa(Z) = Z n + ∑n j=1 ajZ n−j be a Ck curve of monic polynomials, ai ∈ Ck(I,C) where I ⊂ R is an interval. We show that if k = k(n) is sufficiently large then any choice of continuous roots of Pa is locally absolutely continuous, in a uniform way with respect to maxj ‖aj‖Ck on compact ..."
Abstract
 Add to MetaCart
Abstract. Let Pa(Z) = Z n + ∑n j=1 ajZ n−j be a Ck curve of monic polynomials, ai ∈ Ck(I,C) where I ⊂ R is an interval. We show that if k = k(n) is sufficiently large then any choice of continuous roots of Pa is locally absolutely continuous, in a uniform way with respect to maxj ‖aj‖Ck on compact
ON THE UPPER BOUND OF THE MULTIPLICITY CONJECTURE
, 2007
"... Dedicated to Juergen Herzog on the occasion of his 65th birthday Abstract. Let A = K[X1,..., Xn] and let I be a graded ideal in A. We show that the upper bound of Multiplicity conjecture of Herzog, Huneke and Srinivasan holds asymptotically (i.e., for I k and all k≫0) if I belongs to any of the foll ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
= heightI. Consider for 1 ≤ i ≤ p the numbers Mi(A/I) = max{j ∈ Z  βi,j(A/I) ̸ = 0} & mi(A/I) = min{j ∈ Z  βi,j(A/I) ̸ = 0}. j∈Z Let e(A/I) denote the multiplicity of A/I. Set L(I) = 1 c∏ mi(A/I) and U(I) = c! 1 c! i=1 c∏ Mi(A/I). The conjecture of Herzog, Huneke and Srinivasan states that
REPORTS ON MATHEMATICAL LOGIC
"... A b s t r a c t. In this paper, the structure of nitely generated free objects in the variety of threevalued closure Lukasiewicz algebras is determined. We describe their indecomposable factors and we give their cardinality..1 Introduction and Preliminaries A Lukasiewicz algebra of order n, or an n ..."
Abstract
 Add to MetaCart
A b s t r a c t. In this paper, the structure of nitely generated free objects in the variety of threevalued closure Lukasiewicz algebras is determined. We describe their indecomposable factors and we give their cardinality..1 Introduction and Preliminaries A Lukasiewicz algebra of order n, or an nvalued Lukasiewicz algebra, is
1Performance Bounds for Grouped Incoherent Measurements in Compressive Sensing
"... Compressive sensing (CS) allows for acquisition of sparse signals at sampling rates significantly lower than the Nyquist rate required for bandlimited signals. Recovery guarantees for CS are generally derived based on the assumption that measurement projections are selected independently at random. ..."
Abstract
 Add to MetaCart
Compressive sensing (CS) allows for acquisition of sparse signals at sampling rates significantly lower than the Nyquist rate required for bandlimited signals. Recovery guarantees for CS are generally derived based on the assumption that measurement projections are selected independently at random. However, for many practical signal acquisition applications, including medical imaging and remote sensing, this assumption is violated as the projections must be taken in groups. In this paper, we consider such applications and derive requirements on the number of measurements needed for successful recovery of signals when groups of dependent projections are taken at random. We find a penalty factor on the number of required measurements with respect to the standard CS scheme that employs conventional independent measurement selection and evaluate the accuracy of the predicted penalty through simulations. I.
1On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying KSVD
, 2013
"... This article gives theoretical insights into the performance of KSVD, a dictionary learning algorithm that has gained significant popularity in practical applications. The particular question studied here is when a dictionary Φ ∈ Rd×K can be recovered as local minimum of the minimisation criterion ..."
Abstract
 Add to MetaCart
This article gives theoretical insights into the performance of KSVD, a dictionary learning algorithm that has gained significant popularity in practical applications. The particular question studied here is when a dictionary Φ ∈ Rd×K can be recovered as local minimum of the minimisation criterion underlying KSVD from a set of N training signals yn = Φxn. A theoretical analysis of the problem leads to two types of identifiability results assuming the training signals are generated from a tight frame with coefficients drawn from a random symmetric distribution. First asymptotic results showing, that in expectation the generating dictionary can be recovered exactly as a local minimum of the KSVD criterion if the coefficient distribution exhibits sufficient decay. This decay can be characterised by the coherence of the dictionary and the `1norm of the coefficients. Based on the asymptotic results it is further demonstrated that given a finite number of training samples N, such that N / logN = O(K3d), except with probability O(N−Kd) there is a local minimum of the KSVD criterion within distance O(KN−1/4) to the generating dictionary. Index Terms dictionary learning, sparse coding, KSVD, finite sample size, sampling complexity, dictionary identification, minimisation criterion, sparse representation 1
Approved as to style and content by:
, 2014
"... This Open Access Dissertation is brought to you for free and open access by the Dissertations and Theses at ScholarWorks@UMass Amherst. It has ..."
Abstract
 Add to MetaCart
This Open Access Dissertation is brought to you for free and open access by the Dissertations and Theses at ScholarWorks@UMass Amherst. It has
permission. Structured Codes in Information Theory: MIMO and Network Applications
"... All rights reserved. ..."