Sciweavers

3454 search results - page 169 / 691
» Modern computer algebra
Sort
View
MOC
2002
103views more  MOC 2002»
15 years 6 months ago
A computational approach to Hilbert modular group fixed points
Some useful information is known about the fundamental domain for certain Hilbert modular groups. The six nonequivalent points with nontrivial isotropy in the fundamental domains u...
Jesse Ira Deutsch
CVPR
2011
IEEE
15 years 2 months ago
Distributed Computer Vision Algorithms Through Distributed Averaging
Traditional computer vision and machine learning algorithms have been largely studied in a centralized setting, where all the processing is performed at a single central location....
Roberto Tron, René, Vidal
EUROPAR
2009
Springer
15 years 11 months ago
Using Hybrid CPU-GPU Platforms to Accelerate the Computation of the Matrix Sign Function
Abstract. We investigate the performance of two approaches for matrix inversion based on Gaussian (LU factorization) and Gauss-Jordan eliminations. The target architecture is a cur...
Peter Benner, Pablo Ezzatti, Enrique S. Quintana-O...
PPAM
2001
Springer
15 years 11 months ago
pARMS: A Package for Solving General Sparse Linear Systems on Parallel Computers
This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solutio...
Yousef Saad, Masha Sosonkina
ENTCS
2010
117views more  ENTCS 2010»
15 years 6 months ago
Categorifying Computations into Components via Arrows as Profunctors
The notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by structured computations in general. We claim that an arrow also serves as a basic compon...
Kazuyuki Asada, Ichiro Hasuo