Sciweavers

1974 search results - page 58 / 395
» On Unbiased Linear Approximations
Sort
View
87
Voted
MP
2006
93views more  MP 2006»
15 years 16 days ago
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
Xiaojun Chen, Shuhuang Xiang
BIOINFORMATICS
2011
14 years 7 months ago
Algorithms for sorting unsigned linear genomes by the DCJ operations
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both ...
Haitao Jiang, Binhai Zhu, Daming Zhu
96
Voted
ADCM
2006
74views more  ADCM 2006»
15 years 20 days ago
Linearly constrained reconstruction of functions by kernels with applications to machine learning
This paper investigates the approximation of multivariate functions from data via linear combinations of translates of a positive definite kernel from a reproducing kernel Hilbert...
Robert Schaback, J. Werner
59
Voted
MOC
1998
73views more  MOC 1998»
15 years 7 days ago
Detecting perfect powers in essentially linear time
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect ...
Daniel J. Bernstein
MIA
2010
170views more  MIA 2010»
14 years 7 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...