Sciweavers

394 search results - page 33 / 79
» Computing Minimal Polynomials of Matrices
Sort
View
95
Voted
ISBI
2008
IEEE
16 years 1 months ago
Robust image registration based on a Partition of Unity Finite Element Method
In this paper, we present a robust, hierarchical Partition of Unity Finite Element Method (PUFEM) to compute the transformation between two images, which is represented by a non-r...
Laurent D. Cohen, Oudom Somphone, Shérif Ma...
FCT
2003
Springer
15 years 5 months ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith
ICC
2007
IEEE
15 years 6 months ago
Linear Precoding with Minimum BER Criterion for MIMO-OFDM Systems Employing ML Detection
Abstract— This paper proposes a new MIMO-OFDM precoding method that minimizes BER of the maximum likelihood detection (MLD). Conventional MIMO precoding methods can approximately...
Boonsarn Pitakdumrongkija, Kazuhiko Fukawa, Hirosh...
MOC
2010
14 years 7 months ago
A new elasticity element made for enforcing weak stress symmetry
Abstract. We introduce a new mixed method for linear elasticity. The novelty is a simplicial element for the approximate stress. For every positive integer k, the row-wise divergen...
Bernardo Cockburn, Jayadeep Gopalakrishnan, Johnny...
AAAI
2006
15 years 1 months ago
Algorithms for Rationalizability and CURB Sets
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
Michael Benisch, George B. Davis, Tuomas Sandholm