Sciweavers

152 search results - page 13 / 31
» Robust Polynomials and Quantum Algorithms
Sort
View
ICPR
2010
IEEE
13 years 7 months ago
Robust ECG Biometrics by Fusing Temporal and Cepstral Information
—The use of vital signs as a biometric is a potentially viable approach in a variety of application scenarios such as security and personalized health care. In this paper, a nove...
Ming Li, Shrikanth Narayanan
DAGSTUHL
2006
13 years 9 months ago
Probabilistically Stable Numerical Sparse Polynomial Interpolation
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomia...
Mark Giesbrecht, George Labahn, Wen-shin Lee
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
14 years 2 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
14 years 3 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
NECO
2008
83views more  NECO 2008»
13 years 8 months ago
Sequential Fixed-Point ICA Based on Mutual Information Minimization
A new gradient technique is introduced for linear ICA based on the Edgeworth expansion of mutual information, for which the algorithm operates sequentially using fixed-point itera...
Marc M. Van Hulle