Sciweavers

602 search results - page 7 / 121
» A New Approximation Method of the Quadratic Discriminant Fun...
Sort
View
APPML
2007
92views more  APPML 2007»
13 years 7 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
SIAMJO
2010
137views more  SIAMJO 2010»
13 years 5 months ago
Global Convergence of a New Hybrid Gauss--Newton Structured BFGS Method for Nonlinear Least Squares Problems
In this paper, we propose a hybrid Gauss-Newton structured BFGS method with a new update formula and a new switch criterion for the iterative matrix to solve nonlinear least square...
Weijun Zhou, Xiaojun Chen
CVPR
2007
IEEE
14 years 9 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
MOC
2002
103views more  MOC 2002»
13 years 7 months ago
Computation of class numbers of quadratic number fields
We explain how one can dispense with the numerical computation of approximations to the transcendental integral functions involved when computing class numbers of quadratic number ...
Stéphane Louboutin
DSD
2008
IEEE
91views Hardware» more  DSD 2008»
13 years 9 months ago
A New Rounding Algorithm for Variable Latency Division and Square Root Implementations
The aim of this work is to present a method for rounding quadratically converging algorithms that improves their performance. This method is able to reduce significantly the numbe...
D. Piso, Javier D. Bruguera