Sciweavers

935 search results - page 43 / 187
» Some Results on Orthogonal Factorizations
Sort
View
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
14 years 10 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
COMPUTING
2007
103views more  COMPUTING 2007»
14 years 9 months ago
An algebraic approach for H-matrix preconditioners
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
S. Oliveira, F. Yang
ECCV
2010
Springer
15 years 2 months ago
 5D Motion Subspaces for Planar Motions
In practice, rigid objects often move on a plane. The object then rotates around a fixed axis and translates in a plane orthogonal to this axis. For a concrete example, think of a ...
Roland Angst, Marc Pollefeys
ECCV
2010
Springer
15 years 6 days ago
5D Motion Subspaces for Planar Motion
In practice, rigid objects often move on a plane. The object then rotates around a fixed axis and translates in a plane orthogonal to this axis. For a concrete example, think of a...
CHES
2007
Springer
136views Cryptology» more  CHES 2007»
15 years 4 months ago
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
Tetsuya Izu, Jun Kogure, Takeshi Shimoyama