Results 1 - 10 of 1,059

Coarse-grained Algorithms and Implementations of Structural Indexing-based Object Recognition on Intel Touchstone Delta

by Ashfaq A. Khokhar, Gregory W. Cook, Leah H. Jamieson, Edward J. Delp , 1994
"... In this paper, we present efficient parallel solutions for structural indexing-based object recognition on coarse-grained parallel machines. Based on the analysis using the C 3 -model, the parallel algorithm proposed in this paper takes O(Sk=p) computation units and O(p 3=2 ) communication unit ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
In this paper, we present efficient parallel solutions for structural indexing-based object recognition on coarse-grained parallel machines. Based on the analysis using the C 3 -model, the parallel algorithm proposed in this paper takes O(Sk=p) computation units and O(p 3=2 ) communication

18.366 Final Project: Development of a hierarchical coarse-graining algorithm for polymer simulations

by Ahmed E. Ismail , 2003
"... The long-term goal of this project is to develop a hierarchical coarse-grained model of polymer chains which can efficiently and accurately describe the structural and thermodynamic properties of long polymer chains. Moreover, we would like our coarse-grained model to start with a lattice-based desc ..."
Abstract - Add to MetaCart
of the problem. Ideally, we would like to create an algorithm which can achieve large increases in com-putational efficiency with only small trade-offs in computational accuracy. However, most methods of “coarse-graining ” the system to reduce the amount of information which must be computed during the course

Coarse-grained Algorithms and Implementations of Structural Indexing-based Object Recognition on Intel Touchstone Delta* Abstract

by unknown authors
"... In this paper, we present efficient parallel solu-tions for structural indexing-besed object recogn.ition on coarse-grained parallel machines. Based on the anulysis using the (?-model, the parallel algorithm proposed in this paper takes O(Sk/p) computation units and O(p3f2) communication units on a ..."
Abstract - Add to MetaCart
In this paper, we present efficient parallel solu-tions for structural indexing-besed object recogn.ition on coarse-grained parallel machines. Based on the anulysis using the (?-model, the parallel algorithm proposed in this paper takes O(Sk/p) computation units and O(p3f2) communication units on a

CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets 1

by Jie Chi, Mehmet Koyutürk, Ananth Grama
"... Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distributed environment. Such summaries enable more expensive analysis techniques to be applied efficiently under constraints on c ..."
Abstract - Add to MetaCart
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distributed environment. Such summaries enable more expensive analysis techniques to be applied efficiently under constraints

An Optimal Coarse-grained Arc Consistency Algorithm

by Christian Bessiere, Roland H. C. Yap, Yuanlin Zhang - Artificial Intelligence
"... The use of constraint propagation is the main feature of any constraint solver. It is thus of prime importance to manage the propagation in an efficient and effec-tive fashion. There are two classes of propagation algorithms for general constraints: fine-grained algorithms where the removal of a val ..."
Abstract - Cited by 92 (16 self) - Add to MetaCart
value for a variable will be propagated to the corresponding values for other variables, and coarse-grained algorithms where the removal of a value will be propagated to the related variables. One big advantage of coarse-grained algorithms, like AC-3, over fine-grained algorithms, like AC-4, is the ease

C³: An architecture-independent model for coarse-grained parallel machines

by Susanne E. Hambrusch, Ashfaq A. Khokhar , 1994
"... We propose an architecture-independent parallel model, the C³-model. The C³-model evaluates, for a given parallel algorithm and target architecture, the complexity of computation, the pattern of communication, and the potential congestion arising in communication operations. A metric for estimating ..."
Abstract - Cited by 22 (4 self) - Add to MetaCart
the effect of link and processor congestion on the performance of an arbitrary communication operation is developed. We describe how the C³-model can serve as a platform for the development of coarse-grained algorithms sensitive to the parameters of a parallel machine. The initial validation of the C

Resource Allocation for Coarse-Grain

by Ken Eguro, Student Member, Scott Hauck
"... Abstract—The development of domain-specialized reconfigurable devices, and even the nature of domains themselves, has been largely unexplored. In part this is because the same architectural improvements that allow domainspecialized FPGAs to outperform conventional reconfigurable devices also signifi ..."
Abstract - Add to MetaCart
significantly change the design problem. The migration from completely generic lookup tables and highly connected routing fabrics to specialized coarse-grain functional units and very structured communication resources presents designers with the problem of how to best customize the system based upon

parXXL: A Fine Grained Development Environment on Coarse Grained Architectures

by Jens Gustedt, Stéphane Vialle, Amelia De Vivo
"... We present a new integrated environment for cellular computing and other fine grained applications. It is based upon previous developments concerning cellular computing environments (the ParCeL family) and coarse grained algorithms (the SS-CRAP toolbox). It is aimed to be portable and efficient, an ..."
Abstract - Cited by 7 (4 self) - Add to MetaCart
We present a new integrated environment for cellular computing and other fine grained applications. It is based upon previous developments concerning cellular computing environments (the ParCeL family) and coarse grained algorithms (the SS-CRAP toolbox). It is aimed to be portable and efficient

Coarse-Grain Parallel Programming in Jade

by Monica S. Lam, Martin C. Rinard , 1991
"... This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those sections of code to be parallelized with abstract data usage information. The compiler and run-time system use this inf ..."
Abstract - Cited by 51 (4 self) - Add to MetaCart
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those sections of code to be parallelized with abstract data usage information. The compiler and run-time system use

Coarse-Graining Protein Structures With Local Multivariate Features from Molecular Dynamics

by Zhiyong Zhang, Willy Wriggers , 2008
"... A multivariate statistical theory, local feature analysis (LFA), extracts functionally relevant domains from molecular dynamics (MD) trajectories. The LFA representations, like those of principal component analysis (PCA), are low dimensional and provide a reduced basis set for collective motions of ..."
Abstract - Add to MetaCart
seed atoms one after another to a growing set, minimizing a reconstruction error at each addition. This allows for an efficient implementation, but the sequential algorithm does not guarantee the optimal mutual correlation of the sequentially assigned features. Here, we present a novel coarse-graining
Results 1 - 10 of 1,059