Sciweavers

417 search results - page 56 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
IBPRIA
2005
Springer
14 years 2 months ago
An Algorithm for the Detection of Multiple Concentric Circles
This paper presents a method for the detection of multiple concentric circles which is based on the Hough Transform (HT). In order to reduce time and memory space the concentric ci...
Margarida Silveira
MP
2008
135views more  MP 2008»
13 years 8 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
ICCAD
2006
IEEE
104views Hardware» more  ICCAD 2006»
14 years 5 months ago
Fullwave volumetric Maxwell solver using conduction modes
We present a gridless method for solving the interior problem for a set of conductors in an homogeneous dielectric, at sufficiently high frequencies, valid for conductor lengths ...
Salvador Ortiz, Roberto Suaya
PVM
1999
Springer
14 years 27 days ago
Parallel Monte Carlo Algorithms for Sparse SLAE Using MPI
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
Vassil N. Alexandrov, Aneta Karaivanova
TMI
2011
127views more  TMI 2011»
13 years 3 months ago
Reconstruction of Large, Irregularly Sampled Multidimensional Images. A Tensor-Based Approach
Abstract—Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this prob...
Oleksii Vyacheslav Morozov, Michael Unser, Patrick...