Sciweavers

2766 search results - page 10 / 554
» Algorithms for trigonometric polynomials
Sort
View
FPL
2006
Springer
208views Hardware» more  FPL 2006»
14 years 3 days ago
Implementation in Fpgas of Jacobi Method to Solve the Eigenvalue and Eigenvector Problem
This work shows a modular architecture based on FPGA's to solve the eigenvalue problem according to the Jacobi method. This method is able to solve the eigenvalues and eigenv...
Ignacio Bravo, Pedro Jiménez, Manuel Mazo, ...
SIGMETRICS
2008
ACM
13 years 8 months ago
Network distance estimation with dynamic landmark triangles
This paper describes an efficient and accurate approach to estimate the network distance between arbitrary Internet hosts. We use three landmark hosts forming a triangle in two-di...
Zhihua Wen, Michael Rabinovich
JUCS
2006
112views more  JUCS 2006»
13 years 8 months ago
Construction of Wavelets and Applications
: A sequence of increasing translation invariant subspaces can be defined by the Haar-system (or generally by wavelets). The orthogonal projection to the subspaces generates a deco...
Ildikó László, Ferenc Schipp,...
VC
2008
126views more  VC 2008»
13 years 8 months ago
Efficient reconstruction from non-uniform point sets
Abstract We propose a method for non-uniform reconstruction of 3D scalar data. Typically, radial basis functions, trigonometric polynomials or shift-invariant functions are used in...
Erald Vuçini, Torsten Möller, M. Eduar...
AAECC
2010
Springer
136views Algorithms» more  AAECC 2010»
13 years 8 months ago
New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
Grégoire Lecerf