Results 1  10
of
1,378,100
AMS without 4wise independence on product domains
 In 27th International Symposium on Theoretical Aspects of Computer Science (STACS). Leibniz International Proceedings in Informatics (LIPIcs) Series
, 2010
"... In their fundamental work, Alon, Matias and Szegedy [3] presented celebrated sketching techniques and showed that 4wise independence is sufficient to obtain good approximations. The question of what random functions are necessary is fundamental for streaming algorithms (see, e.g., Cormode and Muthu ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
and Muthukrishnan [9].) We present a somewhat surprising fact: on product domain [n] k, the 4wise independence can be omitted at least for the L2 norm. That is, we prove that the sketch of Alon, Matias and Szegedy [3] works even if the 4wise independent functions on [n] k are replaced by the product of 4wise
AMS WITHOUT 4WISE INDEPENDENCE ON PRODUCT DOMAINS
"... ABSTRACT. In their seminal work, Alon, Matias, and Szegedy introduced several sketching techniques, including showing that 4wise independence is sufficient to obtain good approximations of the second frequency moment. In this work, we show that their sketching technique can be extended to product d ..."
Abstract
 Add to MetaCart
domains [n] k by using the product of 4wise independent functions on [n]. Our work extends that of Indyk and McGregor, who showed the result for k = 2. Their primary motivation was the problem of identifying correlations in data streams. In their model, a stream of pairs (i, j) ∈ [n] 2 arrive, giving a
AMS WITHOUT 4WISE INDEPENDENCE ON PRODUCT DOMAINS
"... ABSTRACT. In their seminal work, Alon, Matias, and Szegedy introduced several sketching techniques, including showing that 4wise independence is sufficient to obtain good approximations of the second frequency moment. In this work, we show that their sketching technique can be extended to product d ..."
Abstract
 Add to MetaCart
domains [n] k by using the product of 4wise independent functions on [n]. Our work extends that of Indyk and McGregor, who showed the result for k = 2. Their primary motivation was the problem of identifying correlations in data streams. In their model, a stream of pairs (i, j) ∈ [n] 2 arrive, giving a
www.stacsconf.org AMS WITHOUT 4WISE INDEPENDENCE ON PRODUCT DOMAINS
"... ABSTRACT. In their seminal work, Alon, Matias, and Szegedy introduced several sketching techniques, including showing that 4wise independence is sufficient to obtain good approximations of the second frequency moment. In this work, we show that their sketching technique can be extended to product d ..."
Abstract
 Add to MetaCart
domains [n] k by using the product of 4wise independent functions on [n]. Our work extends that of Indyk and McGregor, who showed the result for k = 2. Their primary motivation was the problem of identifying correlations in data streams. In their model, a stream of pairs (i, j) ∈ [n] 2 arrive, giving a
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Entrepreneurship: Productive, Unproductive, and Destructive
 Journal of Political Economy
, 1990
"... The basic hypothesis is that, while the total supply of entrepreneurs varies anlong societies, the productive contribution of the society's entrepreneurial activities varies much more because of their allocation between productive activities such as innovation and largely unproductive activitie ..."
Abstract

Cited by 599 (2 self)
 Add to MetaCart
The basic hypothesis is that, while the total supply of entrepreneurs varies anlong societies, the productive contribution of the society's entrepreneurial activities varies much more because of their allocation between productive activities such as innovation and largely unproductive
Image denoising using a scale mixture of Gaussians in the wavelet domain
 IEEE TRANS IMAGE PROCESSING
, 2003
"... We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coefficients at adjacent positions and scales are modeled as the product of two independent random variables: a Gaussian vecto ..."
Abstract

Cited by 514 (17 self)
 Add to MetaCart
We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coefficients at adjacent positions and scales are modeled as the product of two independent random variables: a Gaussian
A new scale of social desirability independent of psychopathology
 Journal of Consulting Psychology
, 1960
"... It has long been recognized that personality test scores are influenced by nontestrelevant response determinants. Wiggins and Rumrill (1959) distinguish three approaches to this problem. Briefly, interest in the problem of response distortion has been concerned with attempts at statistical correct ..."
Abstract

Cited by 656 (1 self)
 Add to MetaCart
It has long been recognized that personality test scores are influenced by nontestrelevant response determinants. Wiggins and Rumrill (1959) distinguish three approaches to this problem. Briefly, interest in the problem of response distortion has been concerned with attempts at statistical correction for "faking good " or "faking bad " (Meehl & Hathaway, 1946), the analysis of response sets (Cronbach, 1946,1950), and ratings of the social desirability of personality test items (Edwards, 19 5 7). A further distinction can be made, however, which results in a somewhat different division of approaches to the question of response distortion. Common to both the Meehl
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple
Phylogenetic identification and in situ detection of individual microbial cells without cultivation. Microbiol. Rev
, 1995
"... cultivation.of individual microbial cells without Phylogenetic identification and in situ detection ..."
Abstract

Cited by 1070 (29 self)
 Add to MetaCart
cultivation.of individual microbial cells without Phylogenetic identification and in situ detection
Results 1  10
of
1,378,100