Results 1  10
of
2,225
The primes contain arbitrarily long arithmetic progressions
 Ann. of Math
"... Abstract. We prove that there are arbitrarily long arithmetic progressions of primes. ..."
Abstract

Cited by 268 (31 self)
 Add to MetaCart
Abstract. We prove that there are arbitrarily long arithmetic progressions of primes.
Fitting Smooth Surfaces to Dense Polygon Meshes
 Proceedings of SIGGRAPH 96
, 1996
"... Recent progress in acquiring shape from range data permits the acquisition of seamless millionpolygon meshes from physical models. In this paper, we present an algorithm and system for converting dense irregular polygon meshes of arbitrary topology into tensor product Bspline surface patches with ..."
Abstract

Cited by 240 (5 self)
 Add to MetaCart
Recent progress in acquiring shape from range data permits the acquisition of seamless millionpolygon meshes from physical models. In this paper, we present an algorithm and system for converting dense irregular polygon meshes of arbitrary topology into tensor product Bspline surface patches
Progressive Geometry Compression
, 2000
"... We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist of three distinct components: geometry, parameter, and connectivity information. The latter two do not contribute to the r ..."
Abstract

Cited by 239 (13 self)
 Add to MetaCart
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist of three distinct components: geometry, parameter, and connectivity information. The latter two do not contribute
Cultivating competence, selfefficacy, and intrinsic interest through proximal selfmotivation.
 Journal of Personality and Social Psychology,
, 1981
"... Abstract: The present experiment tested the hypothesis that selfmotivation through proximal goal setting serves as an effective mechanism for cultivating competencies, selfpercepts of efficacy, and intrinsic interest. Children who exhibited gross deficits and disinterest in mathematical tasks pur ..."
Abstract

Cited by 295 (6 self)
 Add to MetaCart
pursued a program of selfdirected learning under conditions involving either proximal subgoals, distal goals, or no goals. Results of the multifaceted assessment provide support for the superiority of proximal selfinfluence. Under proximal subgoals, children progressed rapidly in selfdirected learning
Arithmetic progressions and the primes
 EL ESCORIAL LECTURES
, 2004
"... We describe some of the machinery behind recent progress in establishing infinitely many arithmetic progressions of length k in various sets of integers, in particular in arbitrary dense subsets of the integers, and in the primes. ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We describe some of the machinery behind recent progress in establishing infinitely many arithmetic progressions of length k in various sets of integers, in particular in arbitrary dense subsets of the integers, and in the primes.
ARITHMETIC PROGRESSIONS IN SETS WITH SMALL
, 2005
"... Abstract. We present an elementary proof that if A is a finite set of numbers, and the sumset A+G A is small, A+G A  ≤ cA, along a dense graph G, then A contains kterm arithmetic progressions. 1. ..."
Abstract
 Add to MetaCart
Abstract. We present an elementary proof that if A is a finite set of numbers, and the sumset A+G A is small, A+G A  ≤ cA, along a dense graph G, then A contains kterm arithmetic progressions. 1.
A NEW PROOF OF SZEMERÉDI’S THEOREM FOR ARITHMETIC PROGRESSIONS OF LENGTH FOUR
 GAFA, GEOMETRIC AND FUNCTIONAL ANALYSIS
, 1998
"... ..."
SubRamsey numbers for arithmetic progressions
"... Let the integers 1,...,n be assigned colors. Szemerédi’s theorem implies that if there is a dense color class then there is an arithmetic progression of length three in that color. We study the conditions on the color classes forcing totally multicolored arithmetic progressions of length 3. Let f( ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Let the integers 1,...,n be assigned colors. Szemerédi’s theorem implies that if there is a dense color class then there is an arithmetic progression of length three in that color. We study the conditions on the color classes forcing totally multicolored arithmetic progressions of length 3. Let f
Results 1  10
of
2,225