Sciweavers

2239 search results - page 80 / 448
» Computing with abstract matrix structures
Sort
View
CONCURRENCY
2007
75views more  CONCURRENCY 2007»
15 years 3 months ago
A distributed packed storage for large dense parallel in-core calculations
We propose in this paper a distributed packed storage format that exploits the symmetry or the triangular structure of a dense matrix. This format stores only half of the matrix w...
Marc Baboulin, Luc Giraud, Serge Gratton, Julien L...
ECCV
2002
Springer
16 years 5 months ago
Generalized Rank Conditions in Multiple View Geometry with Applications to Dynamical Scenes
In this paper, the geometry of a general class of projections from ??? to ?! is examined, as a generalization of classic multiple view geometry in computer vision. It is shown that...
Kun Huang, Robert M. Fossum, Yi Ma
BICOB
2009
Springer
15 years 10 months ago
Graph Spectral Approach for Identifying Protein Domains
Here we present a simple method based on graph spectral properties to automatically partition multi-domain proteins into individual domains. The identification of structural domain...
Hari Krishna Yalamanchili, Nita Parekh
PARA
2004
Springer
15 years 8 months ago
Optimization of a Statically Partitioned Hypermatrix Sparse Cholesky Factorization
The sparse Cholesky factorization of some large matrices can require a two dimensional partitioning of the matrix. The sparse hypermatrix storage scheme produces a recursive 2D par...
José R. Herrero, Juan J. Navarro
132
Voted
CSR
2008
Springer
15 years 3 months ago
A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
Arnon Avron, Anna Zamansky