Results 1 - 10 of 5,516

Parallelization of structured, hierarchical adaptive mesh refinement algorithms

by Charles A. Rendleman, Vincent E. Beckner, Mike Lijewski, William Crutchfield, John B. Bell - Computing and Visualization in Science , 2000
"... We describe an approach to parallelization of structured adaptive mesh refinement algorithms. This type of adaptive methodology is based on the use of local grids superimposed on a coarse grid to achieve sufficient resolution in the solution. The key elements of the approach to parallelization are a ..."
Abstract - Cited by 39 (10 self) - Add to MetaCart
We describe an approach to parallelization of structured adaptive mesh refinement algorithms. This type of adaptive methodology is based on the use of local grids superimposed on a coarse grid to achieve sufficient resolution in the solution. The key elements of the approach to parallelization

Distributed Dynamic Data-Structures for Parallel Adaptive Mesh-Refinement

by Manish Parashar, James C. Browne - PROCEEDINGS OF THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING , 1995
"... This paper presents the design and implementation of dynamic distributed data-structures to support parallel adaptive (multigrid) finite difference codes based on hierarchical adaptive mesh-refinement (AMR) techniques for the solution of partial differential equations. The abstraction provided by th ..."
Abstract - Cited by 38 (11 self) - Add to MetaCart
This paper presents the design and implementation of dynamic distributed data-structures to support parallel adaptive (multigrid) finite difference codes based on hierarchical adaptive mesh-refinement (AMR) techniques for the solution of partial differential equations. The abstraction provided

Implementation of a General Mesh Refinement Technique

by Paul Hammon, Petr Krysl
"... Abstract In this paper, we describe a pilot implementation of a hierarchical adaptive mesh refinement technique. While the focus is on the implementation in one-dimensional problems, the methodology is generic in nature in that it is equally applicable to the construction of adaptive approximations ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Abstract In this paper, we describe a pilot implementation of a hierarchical adaptive mesh refinement technique. While the focus is on the implementation in one-dimensional problems, the methodology is generic in nature in that it is equally applicable to the construction of adaptive approximations

Matching words and pictures

by Kobus Barnard, Pinar Duygulu, David Forsyth, Nando De Freitas, David M. Blei, Michael I. Jordan - JOURNAL OF MACHINE LEARNING RESEARCH , 2003
"... We present a new approach for modeling multi-modal data sets, focusing on the specific case of segmented images with associated text. Learning the joint distribution of image regions and words has many applications. We consider in detail predicting words associated with whole images (auto-annotation ..."
Abstract - Cited by 665 (40 self) - Add to MetaCart
, including several which explicitly learn the correspondence between regions and words. We study multi-modal and correspondence extensions to Hofmann’s hierarchical clustering/aspect model, a translation model adapted from statistical machine translation (Brown et al.), and a multi-modal extension to mixture

A rapid hierarchical radiosity algorithm

by Pat Hanrahan, David Salzman - Computer Graphics , 1991
"... This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing lar e polygonal patches. The afgorithm constructs a hierarchic“J representation of the form factor matrix by adaptively subdividing patches into su bpatches according to a user-supplied error bound. The a ..."
Abstract - Cited by 409 (11 self) - Add to MetaCart
This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing lar e polygonal patches. The afgorithm constructs a hierarchic“J representation of the form factor matrix by adaptively subdividing patches into su bpatches according to a user-supplied error bound

Adaptive Display Algorithm for Interactive Frame Rates During Visualization of Complex Virtual Environments

by Thomas Funkhouser, Carlo Sequin , 1993
"... We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model representation in which objects are described at multiple levels of detail and can be drawn with various rendering algorithm ..."
Abstract - Cited by 450 (10 self) - Add to MetaCart
We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model representation in which objects are described at multiple levels of detail and can be drawn with various rendering

Hierarchical Packet Fair Queueing Algorithms

by Jon C. R. Bennett, Hui Zhang - IEEE/ACM Transactions on Networking , 1997
"... In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design Hierarchical Packet Fair Queueing (H-PFQ) algorithms to approximate H-GPS ..."
Abstract - Cited by 341 (7 self) - Add to MetaCart
In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design Hierarchical Packet Fair Queueing (H-PFQ) algorithms to approximate H

Distance Browsing in Spatial Databases

by Gísli R. Hjaltason, Hanan Samet , 1999
"... Two different techniques of browsing through a collection of spatial objects stored in an R-tree spatial data structure on the basis of their distances from an arbitrary spatial query object are compared. The conventional approach is one that makes use of a k-nearest neighbor algorithm where k is kn ..."
Abstract - Cited by 390 (21 self) - Add to MetaCart
), in which case a query engine can make use of a pipelined strategy. A general incremental nearest neighbor algorithm is presented that is applicable to a large class of hierarchical spatial data structures. This algorithm is adapted to the R-tree and its performance is compared to an existing k

Adaptive Mesh Refinement Data

by Ralf Kahler, Hans-christian Hege, Visualization Of Time-dependent
"... Analysis of phenomena that simultaneously occur on quite different spatial and temporal scales require adaptive, hierarchical schemes to reduce computational and storage demands. For data represented as grid functions, the key are adaptive, hierarchical, time-dependent grids that resolve spatio-temp ..."
Abstract - Add to MetaCart
Analysis of phenomena that simultaneously occur on quite different spatial and temporal scales require adaptive, hierarchical schemes to reduce computational and storage demands. For data represented as grid functions, the key are adaptive, hierarchical, time-dependent grids that resolve spatio

Data Structure for hp Mesh-Refinement Techniques

by I. Barosan, F. N. Van De Vosse, P. Anderson
"... Adaptive hp spectral/finite element methods, in which both grid size h and local polynomial order p are dynamically altered, are very effective discretization schemes for numerical solution of a large class of par- ..."
Abstract - Add to MetaCart
Adaptive hp spectral/finite element methods, in which both grid size h and local polynomial order p are dynamically altered, are very effective discretization schemes for numerical solution of a large class of par-
Results 1 - 10 of 5,516