Results 1  10
of
795,041
Multiresolution Analysis for Surfaces Of Arbitrary . . .
, 1993
"... Multiresolution analysis provides a useful and efficient tool for representing shape and analyzing features at multiple levels of detail. Although the technique has met with considerable success when applied to univariate functions, images, and more generally to functions defined on lR , to our k ..."
Abstract

Cited by 389 (3 self)
 Add to MetaCart
Multiresolution analysis provides a useful and efficient tool for representing shape and analyzing features at multiple levels of detail. Although the technique has met with considerable success when applied to univariate functions, images, and more generally to functions defined on lR , to our
Siegel Eisenstein series of arbitrary level and theta series
 Abh. Math. Sem. Hamburg
, 1996
"... Introduction. In this paper we consider Siegel modular forms of genus n and arbitrary level q, which do not vanish at all zero dimensional cusps. If such a form is an eigenform of some power T(p)m, m> 1, of the Hecke operator T(p) with respect to at least one prime p = +__1 mod q and if the weigh ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Introduction. In this paper we consider Siegel modular forms of genus n and arbitrary level q, which do not vanish at all zero dimensional cusps. If such a form is an eigenform of some power T(p)m, m> 1, of the Hecke operator T(p) with respect to at least one prime p = +__1 mod q
Automatic hpAdaptivity With ArbitraryLevel Hanging Nodes
, 2006
"... In this paper we present a new algorithm for fully automatic hpadaptivity for elliptic problems based on arbitrarylevel hanging nodes and local element projections. The algorithm is very simple to implement compared to best existing hpadaptive strategies while its performance is comparable and s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we present a new algorithm for fully automatic hpadaptivity for elliptic problems based on arbitrarylevel hanging nodes and local element projections. The algorithm is very simple to implement compared to best existing hpadaptive strategies while its performance is comparable
Completely Derandomized SelfAdaptation in Evolution Strategies
 Evolutionary Computation
, 2001
"... This paper puts forward two useful methods for selfadaptation of the mutation distribution  the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the selfadapta ..."
Abstract

Cited by 548 (58 self)
 Add to MetaCart
This paper puts forward two useful methods for selfadaptation of the mutation distribution  the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self
Free quasisymmetric functions of arbitrary level
"... Abstract. We introduce analogues of the Hopf algebra of Free quasisymmetric functions with bases labelled by colored permutations. As applications, we recover in a simple way the descent algebras associated with wreath products Γ ≀ Sn and the corresponding generalizations of quasisymmetric functio ..."
Abstract

Cited by 17 (9 self)
 Add to MetaCart
Abstract. We introduce analogues of the Hopf algebra of Free quasisymmetric functions with bases labelled by colored permutations. As applications, we recover in a simple way the descent algebras associated with wreath products Γ ≀ Sn and the corresponding generalizations of quasisymmetric functions. Also, we obtain Hopf algebras of colored parking functions. 1.
Progressive Meshes
"... Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance, transmission bandwidth, and storage capacities. This paper introduces the progressive mesh (PM) representation, a new s ..."
Abstract

Cited by 1313 (11 self)
 Add to MetaCart
scheme for storing and transmitting arbitrary triangle meshes. This efficient, lossless, continuousresolution representation addresses several practical problems in graphics: smooth geomorphing of levelofdetail approximations, progressive transmission, mesh compression, and selective refinement
LLVM: A compilation framework for lifelong program analysis & transformation
, 2004
"... ... a compiler framework designed to support transparent, lifelong program analysis and transformation for arbitrary programs, by providing highlevel information to compiler transformations at compiletime, linktime, runtime, and in idle time between runs. LLVM defines a common, lowlevel code re ..."
Abstract

Cited by 852 (20 self)
 Add to MetaCart
... a compiler framework designed to support transparent, lifelong program analysis and transformation for arbitrary programs, by providing highlevel information to compiler transformations at compiletime, linktime, runtime, and in idle time between runs. LLVM defines a common, lowlevel code
Surface Simplification Using Quadric Error Metrics
"... Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplifi ..."
Abstract

Cited by 1174 (16 self)
 Add to MetaCart
Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface
Basic objects in natural categories
 COGNITIVE PSYCHOLOGY
, 1976
"... Categorizations which humans make of the concrete world are not arbitrary but highly determined. In taxonomies of concrete objects, there is one level of abstraction at which the most basic category cuts are made. Basic categories are those which carry the most information, possess the highest categ ..."
Abstract

Cited by 886 (1 self)
 Add to MetaCart
Categorizations which humans make of the concrete world are not arbitrary but highly determined. In taxonomies of concrete objects, there is one level of abstraction at which the most basic category cuts are made. Basic categories are those which carry the most information, possess the highest
An Algorithm for Computing FourRamond Vertices at Arbitrary Level
, 1992
"... We perform the sewing of two (dual) Ramond reggeon vertices and derive an algorithm by means of which the so obtained fourRamond reggeon vertex may be explicitly computed at arbitrary oscillator (mass) level. A closed form of the fourvertex is then deduced on the basis of a comparison to all terms ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We perform the sewing of two (dual) Ramond reggeon vertices and derive an algorithm by means of which the so obtained fourRamond reggeon vertex may be explicitly computed at arbitrary oscillator (mass) level. A closed form of the fourvertex is then deduced on the basis of a comparison to all
Results 1  10
of
795,041