Results 1  10
of
558,354
ZeroOne Frequency Laws
"... Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMS ” paper on computing frequency moments by Alon, Matias and Szegedy. The main question left open (and explicitly asked) by AM ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
amount of research on frequencybased functions in streaming literature. In this paper we finally resolve the AMS main question and give a precise characterization (in fact, a zeroone law) for all monotonically increasing functions on frequencies that are zero at the origin. That is, we consider all
The generality of the zeroone laws
, 2009
"... We prove gametheoretic generalizations of some well known zeroone laws. Our proofs make the martingales behind the laws explicit, and our results illustrate how martingale arguments can have implications going beyond measuretheoretic probability. 1 ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We prove gametheoretic generalizations of some well known zeroone laws. Our proofs make the martingales behind the laws explicit, and our results illustrate how martingale arguments can have implications going beyond measuretheoretic probability. 1
The Tenacity of ZeroOne Laws
 The Electronic Journal of Combinatorics
"... The EhrenfeuchtFraisse game is a twoperson game of perfect information which is connected to the ZeroOne Laws of rst order logic. We give bounds for roughly how quickly the ZeroOne Laws converge for random bit strings and random circular bit sequences. We measure the tenaciousness of the second ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The EhrenfeuchtFraisse game is a twoperson game of perfect information which is connected to the ZeroOne Laws of rst order logic. We give bounds for roughly how quickly the ZeroOne Laws converge for random bit strings and random circular bit sequences. We measure the tenaciousness of the second
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract

Cited by 1513 (20 self)
 Add to MetaCart
as the class F of those elements whose entries obey the power decay law f  (n) ≤ C · n −1/p. We take measurements 〈f, Xk〉, k = 1,..., K, where the Xk are Ndimensional Gaussian
Strategies of Discourse Comprehension
, 1983
"... El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacke ..."
Abstract

Cited by 601 (27 self)
 Add to MetaCart
serious than in EI Salvador, ” declares one Latin American diplomat. “The oligarchy is that much more reactionary. and the choices are far fewer. “ ‘Zero’: The Guatemalan oligarchs hated Jimmy Carter for cutting off U.S. military aid in 1977 to protest humanrights abusesand the rightwingers hired
Macroscopic strings as heavy quarks in large N gauge theory and Antide Sitter supergravity
 PHYS. J. C22
"... Maldacena has put forward large N correspondence between superconformal field theories on the brane and antide Sitter supergravity in spacetime. We study some aspects of the correspondence between N = 4 superconformal gauge theory on D3brane and maximal supergravity on adS5 × S5 by introducing mac ..."
Abstract

Cited by 510 (1 self)
 Add to MetaCart
potential and again find agreements between the gauge theory and the supergravity results. By turning on RamondRamond zeroform potential, we also study θ vacuum angle dependence of the static potential. We finally discuss dynamical realization of loop equation via turning on local electric field
Sufficient conditions for zeroone laws
 Trans. Amer. Math. Soc
, 2002
"... Abstract. We generalize a result of Bateman and Erdős concerning partitions, thereby answering a question of Compton. From this result it follows that if K is a class of finite relational structures that is closed under the formation of disjoint unions and the extraction of components, and if it has ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
, and if it has the property that the number of indecomposables of size n is bounded above by a polynomial in n, thenK has a monadic second order 01 law. Moreover, we show that if a class of finite structures with the unique factorization property is closed under the formation of direct products
Powerlaw distributions in empirical data
 ISSN 00361445. doi: 10.1137/ 070710111. URL http://dx.doi.org/10.1137/070710111
, 2009
"... Powerlaw distributions occur in many situations of scientific interest and have significant consequences for our understanding of natural and manmade phenomena. Unfortunately, the empirical detection and characterization of power laws is made difficult by the large fluctuations that occur in the t ..."
Abstract

Cited by 589 (7 self)
 Add to MetaCart
Powerlaw distributions occur in many situations of scientific interest and have significant consequences for our understanding of natural and manmade phenomena. Unfortunately, the empirical detection and characterization of power laws is made difficult by the large fluctuations that occur
Comprehending Monads
 Mathematical Structures in Computer Science
, 1992
"... Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised t ..."
Abstract

Cited by 522 (16 self)
 Add to MetaCart
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised to an arbitrary monad, and how the resulting programming feature can concisely express in a pure functional language some programs that manipulate state, handle exceptions, parse text, or invoke continuations. A new solution to the old problem of destructive array update is also presented. No knowledge of category theory is assumed.
Monads for functional programming
, 1995
"... The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or nondeterminism. Three case studies are looked at in detail: how monads ease the modification o ..."
Abstract

Cited by 1481 (39 self)
 Add to MetaCart
The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or nondeterminism. Three case studies are looked at in detail: how monads ease the modification of a simple evaluator; how monads act as the basis of a datatype of arrays subject to inplace update; and how monads can be used to build parsers.
Results 1  10
of
558,354