Sciweavers

15792 search results - page 286 / 3159
» Computational Abstraction Steps
Sort
View
APDC
1997
15 years 8 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
RAS
2006
108views more  RAS 2006»
15 years 7 months ago
A computational model of intention reading in imitation
Imitation in artificial systems involves a number of important aspects, such as extracting the relevant features of the demonstrated behaviour, inverse mapping observations, and e...
Bart Jansen, Tony Belpaeme
TSE
1998
93views more  TSE 1998»
15 years 7 months ago
Xception: A Technique for the Experimental Evaluation of Dependability in Modern Computers
An important step in the development of dependable systems is the validation of their fault tolerance properties. Fault injection has been widely used for this purpose, however wi...
Joao Carreira, Henrique Madeira, João Gabri...
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
15 years 2 months ago
A nested Krylov subspace method to compute the sign function of large complex matrices
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
Jacques Bloch, Simon Heybrock
PROCEDIA
2010
154views more  PROCEDIA 2010»
15 years 2 months ago
Parallel computation of phylogenetic consensus trees
The field of bioinformatics is witnessing a rapid and overwhelming accumulation of molecular sequence data, predominantly driven by novel wet-lab sequencing techniques. This trend...
Andre J. Aberer, Nicholas D. Pattengale, Alexandro...