Results 1  10
of
1,354,523
Dedekind Sums with Arguments near Certain Transcendental Numbers
"... We study the asymptotic behavior of the classical Dedekind sums s(sk/tk) for the sequence of convergents sk/tk k ≥ 0, of the transcendental number j=0 1 b2j, b ≥ 3. In particular, we show that there are infinitely many open intervals of constant length such that the sequence s(sk/tk) has infinitely ..."
Abstract
 Add to MetaCart
We study the asymptotic behavior of the classical Dedekind sums s(sk/tk) for the sequence of convergents sk/tk k ≥ 0, of the transcendental number j=0 1 b2j, b ≥ 3. In particular, we show that there are infinitely many open intervals of constant length such that the sequence s(sk/tk) has infinitely
Various tendencies of nonPoissonian distributions along subsequences of certain transcendental numbers
, 2002
"... In this paper we examine the tendencies of nonPoissonian distributions that arise from the nearest neighbor spacings of for certain transcendental numbers. Tendencies of nonPoissonian distribution means the question of how the Disc functions used depend on the starting and the number of s used to ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper we examine the tendencies of nonPoissonian distributions that arise from the nearest neighbor spacings of for certain transcendental numbers. Tendencies of nonPoissonian distribution means the question of how the Disc functions used depend on the starting and the number of s used
PROBABILITY INEQUALITIES FOR SUMS OF BOUNDED RANDOM VARIABLES
, 1962
"... Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr(SES> nt) depend only on the endpoints of the ranges of the s ..."
Abstract

Cited by 2215 (2 self)
 Add to MetaCart
Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr(SES> nt) depend only on the endpoints of the ranges
LexicalFunctional Grammar: A Formal System for Grammatical Representation
 IN: FORMAL ISSUES IN LEXICALFUNCTIONAL GRAMMAR
, 1995
"... In learning their native language, children develop a remarkable set of capabilities. They acquire knowledge and skills that enable them to produce and comprehend an indefinite number of novel utterances, and to make quite subtle judgments about certain of their properties. The major goal of psychol ..."
Abstract

Cited by 609 (23 self)
 Add to MetaCart
In learning their native language, children develop a remarkable set of capabilities. They acquire knowledge and skills that enable them to produce and comprehend an indefinite number of novel utterances, and to make quite subtle judgments about certain of their properties. The major goal
A Simple Proof of the Restricted Isometry Property for Random Matrices
 CONSTR APPROX
, 2008
"... We give a simple technique for verifying the Restricted Isometry Property (as introduced by Candès and Tao) for random matrices that underlies Compressed Sensing. Our approach has two main ingredients: (i) concentration inequalities for random inner products that have recently provided algorithmical ..."
Abstract

Cited by 631 (64 self)
 Add to MetaCart
algorithmically simple proofs of the Johnson–Lindenstrauss lemma; and (ii) covering numbers for finitedimensional balls in Euclidean space. This leads to an elementary proof of the Restricted Isometry Property and brings out connections between Compressed Sensing and the Johnson–Lindenstrauss lemma. As a result
Web Caching and Zipflike Distributions: Evidence and Implications
 IN INFOCOM
, 1999
"... This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf's law [22]. Several early studies have supported this claim [9], [5], while other recent studies have suggested otherwise [16], [2] ..."
Abstract

Cited by 1091 (2 self)
 Add to MetaCart
]. The ;econd issue relates to a number of recent studies on the characteristics of web proxy traces, which have shown that the hitratios and temporal locality of the traces exhibit certain asymptotic properties that are uniform across the different sets of the traces [43, [XO], [71, [XO], [XS]. In partlc
Learning and development in neural networks: The importance of starting small
 Cognition
, 1993
"... It is a striking fact that in humans the greatest learnmg occurs precisely at that point in time childhood when the most dramatic maturational changes also occur. This report describes possible synergistic interactions between maturational change and the ability to learn a complex domain (language ..."
Abstract

Cited by 531 (17 self)
 Add to MetaCart
(language), as investigated in connectionist networks. The networks are trained to process complex sentences involving relative clauses, number agreement, and several types of verb argument structure. Training fails in the case of networks which are fully formed and ‘adultlike ’ in their capacity. Training
A volumetric method for building complex models from range images,”
 in Proceedings of the 23rd annual conference on Computer graphics and interactive techniques. ACM,
, 1996
"... Abstract A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction, ..."
Abstract

Cited by 1020 (17 self)
 Add to MetaCart
Abstract A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction
Factoring polynomials with rational coefficients
 MATH. ANN
, 1982
"... In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomia ..."
Abstract

Cited by 961 (11 self)
 Add to MetaCart
to be factored, n = deg(f) is the degree of f, and for a polynomial ~ a ~ i with real coefficients a i. i An outline of the algorithm is as follows. First we find, for a suitable small prime number p, a padic irreducible factor h of f, to a certain precision. This is done with Berlekamp's algorithm
Design of capacityapproaching irregular lowdensity paritycheck codes
 IEEE TRANS. INFORM. THEORY
, 2001
"... We design lowdensity paritycheck (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the unde ..."
Abstract

Cited by 588 (6 self)
 Add to MetaCart
that the underlying communication channel is symmetric, we prove that the probability densities at the message nodes of the graph possess a certain symmetry. Using this symmetry property we then show that, under the assumption of no cycles, the message densities always converge as the number of iterations tends
Results 1  10
of
1,354,523