Sciweavers

5864 search results - page 7 / 1173
» Can We Work around Numerical Methods
Sort
View
CP
1999
Springer
14 years 22 days ago
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
Claudio Lottaz
IPPS
2010
IEEE
13 years 6 months ago
Optimizing and tuning the fast multipole method for state-of-the-art multicore architectures
This work presents the first extensive study of singlenode performance optimization, tuning, and analysis of the fast multipole method (FMM) on modern multicore systems. We consid...
Aparna Chandramowlishwaran, Samuel Williams, Leoni...
TMI
2010
298views more  TMI 2010»
13 years 3 months ago
An Efficient Numerical Method for General Lp Regularization in Fluorescence Molecular Tomography
Abstract--Reconstruction algorithms for fluorescence tomography have to address two crucial issues : (i) the ill-posedness of the reconstruction problem, (ii) the large scale of nu...
Jean-Charles Baritaux, Kai Hassler, Michael Unser
ICDAR
2003
IEEE
14 years 1 months ago
Shape Matching Using GAT Correlation against Nonlinear Distortion and its Application to Handwritten Numeral Recognition
This paper addresses the problem of to what extent linear transformation can alleviate nonlinear distortion. We investigate a technique of global affine transformation (GAT) corre...
Toru Wakahara
TIP
2002
126views more  TIP 2002»
13 years 8 months ago
Template matching based object recognition with unknown geometric parameters
In this paper, we examine the problem of locating an object in an image when size and rotation are unknown. Previous work has shown that with known geometric parameters, an image r...
Roger M. Dufour, Eric L. Miller, Nikolas P. Galats...