Results 1  10
of
612
RezkSalama C. Highquality volume graphics on consumer pc hardware
 In: proceedings of SIGGRAPH 2002, course notes 42
, 2002
"... Course Notes 42 Interactive volume visualization in science and entertainment is no longer restricted to expensive workstations and dedicated hardware thanks to the fast evolution of consumer graphics driven by entertainment markets. Course participants will learn to leverage new features of modern ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
, and hardware accelerated filtering. The course is aimed at scientific researchers and entertainment developers. Course participants are provided with documented source code covering details usually omitted in publications. 2
Three models for the homotopy theory of homotopy theories
, 2005
"... its simplicial localization yields a “homotopy theory of homotopy theories. ” In this paper we show that there are two different categories of diagrams of simplicial sets, each equipped with an appropriate definition of weak equivalence, such that the resulting homotopy theories are each equivalent ..."
Abstract

Cited by 78 (19 self)
 Add to MetaCart
to the homotopy theory arising from the model category structure on simplicial categories. Thus, any of these three categories with their respective weak equivalences could be considered a model for the homotopy theory of homotopy theories. One of them in particular, Rezk’s complete Segal space model category
Refinement types for secure implementations
 IN 21ST IEEE COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF’08
, 2008
"... We present the design and implementation of a typechecker for verifying security properties of the source code of cryptographic protocols and access control mechanisms. The underlying type theory is a λcalculus equipped with refinement types for expressing pre and postconditions within firstorde ..."
Abstract

Cited by 111 (24 self)
 Add to MetaCart
We present the design and implementation of a typechecker for verifying security properties of the source code of cryptographic protocols and access control mechanisms. The underlying type theory is a λcalculus equipped with refinement types for expressing pre and postconditions within firstorder logic. We derive formal cryptographic primitives and represent active adversaries within the type theory. Welltyped programs enjoy assertionbased security properties, with respect to a realistic threat model including key compromise. The implementation amounts to an enhanced typechecker for the general purpose functional language F#; typechecking generates verification conditions that are passed to an SMT solver. We describe a series of checked examples. This is the first tool to verify authentication properties of cryptographic protocols by typechecking their source code.
E(8) Gauge Theory and a Derivation of Ktheory from Mtheory
"... The partition function of RamondRamond pform fields in Type IIA supergravity on a tenmanifold X contains subtle phase factors that are associated with Tduality, selfduality, and the relation of the RR fields to Ktheory. The analogous partition function of Mtheory on X × S 1 contains subtle pha ..."
Abstract

Cited by 110 (9 self)
 Add to MetaCart
The partition function of RamondRamond pform fields in Type IIA supergravity on a tenmanifold X contains subtle phase factors that are associated with Tduality, selfduality, and the relation of the RR fields to Ktheory. The analogous partition function of Mtheory on X × S 1 contains subtle phases that are similarly associated with E8 gauge theory. We analyze the detailed phase factors on the two sides and show that they agree, thereby testing Mtheory/Type IIA duality as well as the Ktheory formalism in an interesting way. We also show that certain Dbrane states wrapped on nontrivial homology cycles are actually unstable, that (−1) FL symmetry in Type IIA superstring theory depends in general on a cancellation between a fermion anomaly and an anomaly of RR fields, and that Type IIA superstring theory with no wrapped branes is welldefined only on a spacetime with W7 = 0. On leave from Institute for Advanced Study, Princeton, NJ 08540.
M.: Realtime raycasting and advanced shading of discrete isosurfaces
 Computer Graphics Forum
"... Figure 1: We render highquality implicit surfaces on regular grids, e.g., distance fields or medical CT scans, in realtime without precomputing additional pervoxel information. Gradients with C1 continuity, secondorder derivatives, and surface curvature are computed exactly for each output pixe ..."
Abstract

Cited by 84 (12 self)
 Add to MetaCart
Figure 1: We render highquality implicit surfaces on regular grids, e.g., distance fields or medical CT scans, in realtime without precomputing additional pervoxel information. Gradients with C1 continuity, secondorder derivatives, and surface curvature are computed exactly for each output
FastLSM: fast lattice shape matching for robust realtime deformation
 PROC. OF ACM SIGGRAPH
, 2007
"... We introduce a simple technique that enables robust approximation of volumetric, largedeformation dynamics for realtime or largescale offline simulations. We propose Lattice Shape Matching, an extension of deformable shape matching to regular lattices with embedded geometry; lattice vertices are ..."
Abstract

Cited by 62 (3 self)
 Add to MetaCart
We introduce a simple technique that enables robust approximation of volumetric, largedeformation dynamics for realtime or largescale offline simulations. We propose Lattice Shape Matching, an extension of deformable shape matching to regular lattices with embedded geometry; lattice vertices are smoothed by convolution of rigid shape matching operators on local lattice regions, with the effective mechanical stiffness specified by the amount of smoothing via region width. Since the naïve method can be very slow for stiff models – pervertex costs scale cubically with region width – we provide a fast summation algorithm, Fast Lattice Shape Matching (FastLSM), that exploits the inherent summation redundancy of shape matching and can provide largeregion matching at constant pervertex cost. With this approach, large lattices can be simulated in linear time. We present several examples and benchmarks of an efficient CPU implementation, including many dozens of soft bodies simulated at realtime rates on a typical desktop machine.
Fractal upper bounds on the density of semiclassical resonances
 Duke Math. Journal
"... Let P = −h 2 ∆g +V (x) be a selfadjoint Schrödinger operator on a compact Riemannian nmanifold, (X, g), V ∈ C ∞ (X; R). The spectral asymptotics as h → 0 are given by the celebrated Weyl law – see [10] and [16] for recent advances and numerous references. If we assume that the zero energy surface ..."
Abstract

Cited by 58 (19 self)
 Add to MetaCart
Let P = −h 2 ∆g +V (x) be a selfadjoint Schrödinger operator on a compact Riemannian nmanifold, (X, g), V ∈ C ∞ (X; R). The spectral asymptotics as h → 0 are given by the celebrated Weyl law – see [10] and [16] for recent advances and numerous references. If we assume that the zero energy surface
ORIENTATIONS AND pADIC ANALYSIS
, 905
"... Abstract. Matthew Ando produced power operations in the LubinTate cohomology theories and was able to classify which complex orientations were compatible with these operations. The methods used by Ando, Hopkins and Rezk to classify orientations of topological modular forms can be applied to complex ..."
Abstract
 Add to MetaCart
Abstract. Matthew Ando produced power operations in the LubinTate cohomology theories and was able to classify which complex orientations were compatible with these operations. The methods used by Ando, Hopkins and Rezk to classify orientations of topological modular forms can be applied
Results 1  10
of
612