Results 1  10
of
6,320
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 653 (7 self)
 Add to MetaCart
. The algorithms are tested on a standard LennardJones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers  the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray YMP and C90 algorithm shows
Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of nalkanes
 J. Comput. Phys
, 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract

Cited by 704 (6 self)
 Add to MetaCart
(MD), which has been widely used in the past for studying simple liquids and solids, has more recently been applied to molecular systems with internal degrees of freedom such as N, [l], H,O [2] and even C,H,, [3]. In applying the MD method three problems arise: (a) the choice of a suitable mechanical
Data Preparation for Mining World Wide Web Browsing Patterns
 KNOWLEDGE AND INFORMATION SYSTEMS
, 1999
"... The World Wide Web (WWW) continues to grow at an astounding rate in both the sheer volume of tra#c and the size and complexity of Web sites. The complexity of tasks such as Web site design, Web server design, and of simply navigating through a Web site have increased along with this growth. An i ..."
Abstract

Cited by 567 (43 self)
 Add to MetaCart
The World Wide Web (WWW) continues to grow at an astounding rate in both the sheer volume of tra#c and the size and complexity of Web sites. The complexity of tasks such as Web site design, Web server design, and of simply navigating through a Web site have increased along with this growth
ReTiling Polygonal Surfaces
 Computer Graphics
, 1992
"... This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at various levels of detail is important for achieving high frame rates in interactive graphics applications and also for speed ..."
Abstract

Cited by 445 (3 self)
 Add to MetaCart
successfully applied to isosurface models derived from volume data, Connolly surface molecular models and a tessellation of a minimal surface of interest to mathematicians. CRCategoriesandSubjectDescriptors: I.3.3 [ComputerGraph ics]: Picture/Image Generation  Display algorithms
Efficient ray tracing of volume data
 ACM Transactions on Graphics
, 1990
"... Volume rendering is a technique for visualizing sampled scalar or vector fields of three spatial dimensions without fitting geometric primitives to the data. A subset of these techniques generates images by computing 2D projections of a colored semitransparent volume, where the color and opacity at ..."
Abstract

Cited by 392 (5 self)
 Add to MetaCart
Volume rendering is a technique for visualizing sampled scalar or vector fields of three spatial dimensions without fitting geometric primitives to the data. A subset of these techniques generates images by computing 2D projections of a colored semitransparent volume, where the color and opacity
An Efficient Approach to Clustering in Large Multimedia Databases with Noise".
 Proceeding of KDD '98.
, 1998
"... Abstract Several clustering algorithms can be applied to clustering in large multimedia databases. The effectiveness and efficiency of the existing algorithms, however, is somewhat limited, since clustering in multimedia databases requires clustering highdimensional feature vectors and since multi ..."
Abstract

Cited by 278 (13 self)
 Add to MetaCart
series of experiments on a number of different data sets from CAD and molecular biology. A comparison with DBSCAN shows the superiority of our new approach.
Jacobi Angles For Simultaneous Diagonalization.
 SIAM J. Mat. Anal. Appl
, 1996
"... . Simultaneous diagonalization of several matrices can be implemented by a Jacobilike technique. This note gives the required Jacobi angles in close form. Key words. Simultaneous diagonalization, Jacobi iterations, eigenvalues, eigenvectors, structured eigenvalue problem. AMS subject classificati ..."
Abstract

Cited by 192 (3 self)
 Add to MetaCart
identification problem [2] (see [3] for a later paper in English). The simultaneous diagonalization algorithm described in these papers is an extension of the Jacobi technique: a joint diagonality criterion is iteratively optimized under plane rotations. The purpose of this note is to complement [1] by giving a
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
an imaging experiment using an array of n C receiver coils. Fourier encoding is described by a set of n K sampling positions in kspace. Let the whole object be within the volume of interest (VOI). Then a sample value m obtained from the ␥th coil at the th position in kspace is given by where r denotes 3D
An Õ(2^n) Volume Molecular Algorithm for Hamiltonian Path
, 1998
"... We design volumeefficient molecular algorithms for all problems in #P, using only reasonable biological operations. In particular, we give a polynomialtime O(2^n n² log² n)volume algorithm to compute the number of Hamiltonian paths in an nnode graph. This improves Adleman's celebrated n! ..."
Abstract
 Add to MetaCart
We design volumeefficient molecular algorithms for all problems in #P, using only reasonable biological operations. In particular, we give a polynomialtime O(2^n n² log² n)volume algorithm to compute the number of Hamiltonian paths in an nnode graph. This improves Adleman's celebrated n!volume
Volume Rendering by Adaptive Refinement
, 1989
"... Volume rendering is a technique for visualizing sampled scalar functions of three spatial dimensions by computing 2D projections of a colored semitransparent gel. This paper presents a volume rendering algorithm in which image quality is adaptively refined over time. An initial image is generated b ..."
Abstract

Cited by 64 (5 self)
 Add to MetaCart
Volume rendering is a technique for visualizing sampled scalar functions of three spatial dimensions by computing 2D projections of a colored semitransparent gel. This paper presents a volume rendering algorithm in which image quality is adaptively refined over time. An initial image is generated
Results 1  10
of
6,320