Results 1  10
of
62,174
log log k
"... Abstract. We study resonances of surfaces of revolution obtained by removing a disk from a cone and attaching a hyperbolic cusp in its place. These surfaces include ones with nontrapping geodesic flow (every maximally extended nonreflected geodesic is unbounded) and yet infinitely many long living ..."
Abstract
 Add to MetaCart
Abstract. We study resonances of surfaces of revolution obtained by removing a disk from a cone and attaching a hyperbolic cusp in its place. These surfaces include ones with nontrapping geodesic flow (every maximally extended nonreflected geodesic is unbounded) and yet infinitely many long living resonances (resonances with uniformly bounded imaginary part, i.e. decay rate). Let a < 0 < b, and let (X, g) be the surface of revolution X = R × S 1, g = dr 2 + f(r) 2 dθ 2, f(r) = 1 + ar if r ≤ 0, e−br if r> 0. Figure 1. The surface of revolution (X, g) for a + b = 0, a + b> 0, and a + b < 0. Let ∆g be the nonnegative Laplacian on (X, g). The resolvent (∆g − λ 2) −1 is holomorphic L 2 (X) → L 2 (X) for Im λ> 0. Poles of the continuation of its integral kernel from {Im λ> 0} to {Im λ ≤ 0, Re λ> b/2} are called resonances (see [Me, Zw3]). Theorem. The surface of revolution (X, g) has a sequence of resonances (λk)k≥k0 satisfying Re λk = πb
(log log N)2
"... §0. Statement and discussion of the argument This paper is a sequel to [B]. Our main result is an improvement of the density condition for a subset A ⊂ {1,...,N} to contain a nontrivial arithmetic progression of length 3. More specifically, we prove the following ..."
Abstract
 Add to MetaCart
§0. Statement and discussion of the argument This paper is a sequel to [B]. Our main result is an improvement of the density condition for a subset A ⊂ {1,...,N} to contain a nontrivial arithmetic progression of length 3. More specifically, we prove the following
Classical and new log logtheorems
, 2009
"... We present a unified approach to celebrated log logtheorems of Carleman, Wolf, Levinson, Sjöberg, Matsaev on majorants of analytic functions. Moreover, we obtain stronger results by replacing original pointwise bounds with integral ones. The main ingredient is a complete description for radial proj ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a unified approach to celebrated log logtheorems of Carleman, Wolf, Levinson, Sjöberg, Matsaev on majorants of analytic functions. Moreover, we obtain stronger results by replacing original pointwise bounds with integral ones. The main ingredient is a complete description for radial
The LogLog Term Frequency Distribution
, 2005
"... Though commonly used, the unigram is widely known as being a poor model of term frequency; it assumes that term occurrences are independent, whereas many words, especially topicoriented ones, tend to occur in bursts. Herein, we propose a model of term frequency that treats words independently, but ..."
Abstract
 Add to MetaCart
Though commonly used, the unigram is widely known as being a poor model of term frequency; it assumes that term occurrences are independent, whereas many words, especially topicoriented ones, tend to occur in bursts. Herein, we propose a model of term frequency that treats words independently, but allows for much higher variance in frequency values than does the unigram. Although it has valuable properties, and may be useful as a teaching tool, we are not able to find any applications that make a compelling case for its use. 1 The Unigram Model The unigram is a simple, commonly used, model of text. It assumes that each word occurrence is independent of all other word occurrences. There is one parameter per word, θi, � i θi = 1, which corresponds to that word’s rate of occurrence. For a document of length l, the chance that a unigram with parameters {θi} yields term frequencies {xi} is
References π, log π, log log π, log log log π,...
, 2008
"... Rough outlines of the project a) (Expanding a remark by S. Lang – [1]). Define K0 = Q. Inductively, for n ≥ 1, define Kn as the algebraic closure of the field generated over Kn−1 by the numbers e x, where x ranges over Kn−1. Let Ω+ be the union of Kn, n ≥ 0. Show that the numbers are algebraically i ..."
Abstract
 Add to MetaCart
Rough outlines of the project a) (Expanding a remark by S. Lang – [1]). Define K0 = Q. Inductively, for n ≥ 1, define Kn as the algebraic closure of the field generated over Kn−1 by the numbers e x, where x ranges over Kn−1. Let Ω+ be the union of Kn, n ≥ 0. Show that the numbers are algebraically independent over Ω+.
RUSPACE(log n) \subseteq DSPACE(log² n/log log n)
 THE 7TH ANNUAL INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION (ISAAC’96
, 1998
"... We present a deterministic algorithm running in space O , log n= log log n # solving the connectivity problem on strongly unambiguous graphs. In addition, we presentanO#log n# timebounded algorithm for this problem running on a parallel pointer machine. ..."
Abstract
 Add to MetaCart
We present a deterministic algorithm running in space O , log n= log log n # solving the connectivity problem on strongly unambiguous graphs. In addition, we presentanO#log n# timebounded algorithm for this problem running on a parallel pointer machine.
(poly(log log n), poly(log log n))Restricted Verifiers are Unlikely to Exist for Languages in NP
 in NP . Proc. of the 21th Mathematical Foundations of Computer Science
, 1996
"... . The aim of this paper is to present a proof of the equivalence of the equalities NP = PCP(log log n; 1) and P = NP. The proof is based on producing long pseudorandom bit strings through random walks on expander graphs. This technique also implies that for any language in NP there exists a res ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. The aim of this paper is to present a proof of the equivalence of the equalities NP = PCP(log log n; 1) and P = NP. The proof is based on producing long pseudorandom bit strings through random walks on expander graphs. This technique also implies that for any language in NP there exists a
Randomized loose renaming in O(log log n) time Randomized Loose Renaming in O(log log n) Time
"... ABSTRACT Renaming is a classic distributed coordination task in which a set of processes must pick distinct identifiers from a small namespace. In this paper, we consider the time complexity of this problem when the namespace is linear in the number of participants, a variant known as loose renamin ..."
Abstract
 Add to MetaCart
renaming. We give a nonadaptive algorithm with O(log log n) (individual) step complexity, where n is a known upper bound on contention, and an adaptive algorithm with step complexity O((log log k) 2 ), where k is the actual contention in the execution. We also present a variant of the adaptive algorithm
An optimal O(log log n) time parallel string matching algorithm
 SIAM J. COMPUT
, 1990
"... An optimal O(log log n) time parallel algorithm for string matching on CRCWPRAM is presented. It improves previous results of [G] and [V]. ..."
Abstract

Cited by 27 (11 self)
 Add to MetaCart
An optimal O(log log n) time parallel algorithm for string matching on CRCWPRAM is presented. It improves previous results of [G] and [V].
A Log Log Law for Maximal Uniform Spacings
, 1982
"... this paper is to show that the constant c in (1.2) islog 2 ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
this paper is to show that the constant c in (1.2) islog 2
Results 1  10
of
62,174