Results 1  10
of
137,680
TWISTOR FIBRATIONS GIVING PRIMITIVE HARMONIC MAPS OF FINITE TYPE
"... Primitive harmonic maps of finite type from a Riemann surface M into a ksymmetric space G/H are obtained by integrating a pair of commuting Hamiltonian vector fields on certain finitedimensional subspaces of loop algebras. We will clarify and generalize Ohnita and Udagawa's results concernin ..."
Abstract
 Add to MetaCart
Primitive harmonic maps of finite type from a Riemann surface M into a ksymmetric space G/H are obtained by integrating a pair of commuting Hamiltonian vector fields on certain finitedimensional subspaces of loop algebras. We will clarify and generalize Ohnita and Udagawa's results
Special Lagrangian cones in C³ and primitive harmonic maps
 J. LOND. MATH. SOC
, 2002
"... In this article I show that every special Lagrangian cone in C³ determines, and is determined by, a primitive harmonic surface in the 6symmetric space SU3/SO2. For cones over tori, this allows us to use the classification theory of harmonic tori to describe the construction of all the corresponding ..."
Abstract
 Add to MetaCart
In this article I show that every special Lagrangian cone in C³ determines, and is determined by, a primitive harmonic surface in the 6symmetric space SU3/SO2. For cones over tori, this allows us to use the classification theory of harmonic tori to describe the construction of all
View Interpolation for Image Synthesis
"... Imagespace simplifications have been used to accelerate the calculation of computer graphic images since the dawn of visual simulation. Texture mapping has been used to provide a means by which images may themselves be used as display primitives. The work reported by this paper endeavors to carry t ..."
Abstract

Cited by 603 (0 self)
 Add to MetaCart
Imagespace simplifications have been used to accelerate the calculation of computer graphic images since the dawn of visual simulation. Texture mapping has been used to provide a means by which images may themselves be used as display primitives. The work reported by this paper endeavors to carry
Lambertian Reflectance and Linear Subspaces
, 2000
"... We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a wi ..."
Abstract

Cited by 526 (20 self)
 Add to MetaCart
We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a
Heuristics for Internet Map Discovery
, 2000
"... Mercator is a program that uses hoplimited probesthe same primitive used in tracerouteto infer an Internet map. It uses informed random address probing to carefully exploring the IP address space when determining router adjacencies, uses sourceroute capable routers wherever possible to enhan ..."
Abstract

Cited by 385 (13 self)
 Add to MetaCart
Mercator is a program that uses hoplimited probesthe same primitive used in tracerouteto infer an Internet map. It uses informed random address probing to carefully exploring the IP address space when determining router adjacencies, uses sourceroute capable routers wherever possible
On the existence of harmonic maps
, 1977
"... (1.1) A map between Riemannian manifolds is harmonic if the divergence of its differential vanishes. (Those terms will be defined in §3.) Such maps are the extrema ( = critical points) of the energy functional. More precisely, if <$>: M* • N is a map between Riemannian manifolds, we define ..."
Abstract

Cited by 279 (3 self)
 Add to MetaCart
(1.1) A map between Riemannian manifolds is harmonic if the divergence of its differential vanishes. (Those terms will be defined in §3.) Such maps are the extrema ( = critical points) of the energy functional. More precisely, if <$>: M* • N is a map between Riemannian manifolds, we define
Equivariant harmonic cylinders
"... Abstract. We prove that a primitive harmonic map is equivariant if and only if it admits a holomorphic potential of degree one. We investigate when the equivariant harmonic map is periodic, and as an application discuss constant mean curvature cylinders with screw motion symmetries. ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Abstract. We prove that a primitive harmonic map is equivariant if and only if it admits a holomorphic potential of degree one. We investigate when the equivariant harmonic map is periodic, and as an application discuss constant mean curvature cylinders with screw motion symmetries.
Computing Discrete Minimal Surfaces and Their Conjugates
 EXPERIMENTAL MATHEMATICS
, 1993
"... We present a new algorithm to compute stable discrete minimal surfaces bounded by a number of fixed or free boundary curves in R³, S³ and H³. The algorithm makes no restriction on the genus and can handle singular triangulations. For a discrete harmonic map a conjugation process is presented leading ..."
Abstract

Cited by 347 (10 self)
 Add to MetaCart
We present a new algorithm to compute stable discrete minimal surfaces bounded by a number of fixed or free boundary curves in R³, S³ and H³. The algorithm makes no restriction on the genus and can handle singular triangulations. For a discrete harmonic map a conjugation process is presented
Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
 Proceedings of the National Academy of Sciences
, 2005
"... of contexts of data analysis, such as spectral graph theory, manifold learning, nonlinear principal components and kernel methods. We augment these approaches by showing that the diffusion distance is a key intrinsic geometric quantity linking spectral theory of the Markov process, Laplace operators ..."
Abstract

Cited by 257 (45 self)
 Add to MetaCart
of contexts of data analysis, such as spectral graph theory, manifold learning, nonlinear principal components and kernel methods. We augment these approaches by showing that the diffusion distance is a key intrinsic geometric quantity linking spectral theory of the Markov process, Laplace operators, or kernels, to the corresponding geometry and density of the data. This opens the door to the application of methods from numerical analysis and signal processing to the analysis of functions and transformations of the data. Abstract. We provide a framework for structural multiscale geometric organization of graphs and subsets of Rn. We use diffusion semigroups to generate multiscale geometries in order to organize and represent complex structures. We show that appropriately selected eigenfunctions or scaling functions of Markov matrices, which describe local transitions, lead to macroscopic descriptions at different scales. The process of iterating or diffusing the Markov matrix is seen as a generalization of some aspects of the Newtonian paradigm, in which local infinitesimal transitions of a system lead to global macroscopic descriptions by integration. In Part I below, we provide a unified view of ideas from data analysis, machine learning and numerical analysis. In Part II [1], we augment this approach by introducing fast orderN algorithms for homogenization of heterogeneous structures as well as for data representation. 1.
Virtual Memory Mapped Network Interface for the SHRIMP Multicomputer
 IN PROCEEDINGS OF THE 21ST ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE
, 1994
"... The network interfaces of existing multicomputers require a significant amount of software overhead to provide protection and to implement message passing protocols. This paper describes the design of a lowlatency, highbandwidth, virtual memorymapped network interface for the SHRIMP multicomputer ..."
Abstract

Cited by 267 (24 self)
 Add to MetaCart
The network interfaces of existing multicomputers require a significant amount of software overhead to provide protection and to implement message passing protocols. This paper describes the design of a lowlatency, highbandwidth, virtual memorymapped network interface for the SHRIMP
Results 1  10
of
137,680