Sciweavers

264 search results - page 5 / 53
» Regular Mesh Construction Algorithms using Regular Handles
Sort
View
IFIP
2004
Springer
15 years 2 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
PR
2011
14 years 4 months ago
Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization
Non-blind motion deblurring problems are highly ill-posed and so it is quite difficult to find the original sharp and clean image. To handle ill-posedness of the motion deblurrin...
Sangwoon Yun, Hyenkyun Woo
VIS
2008
IEEE
134views Visualization» more  VIS 2008»
15 years 10 months ago
A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for lar...
Attila Gyulassy, Peer-Timo Bremer, Bernd Hamann,...
CF
2006
ACM
15 years 3 months ago
Memory efficient parallel matrix multiplication operation for irregular problems
Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed mat...
Manojkumar Krishnan, Jarek Nieplocha
AAECC
2008
Springer
63views Algorithms» more  AAECC 2008»
14 years 9 months ago
Probabilistic algorithms for computing resolvent representations of regular differential ideals
In a previous article [14], we proved the existence of resolvent representations for regular differential ideals. The present paper provides practical algorithms for computing suc...
Thomas Cluzeau, Evelyne Hubert