Sciweavers

6110 search results - page 277 / 1222
» Approximate Computing
Sort
View
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
16 years 3 days ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
ICCS
2004
Springer
16 years 6 hour ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
TSP
2008
178views more  TSP 2008»
15 years 6 months ago
Digital Computation of Linear Canonical Transforms
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
A. Koc, Haldun M. Özaktas, Cagatay Candan, M....
MICCAI
2008
Springer
16 years 7 months ago
Efficient Computation of PDF-Based Characteristics from Diffusion MR Signal
Abstract. We present a general method for the computation of PDFbased characteristics of the tissue micro-architecture in MR imaging. The approach relies on the approximation of th...
David Tschumperlé, Haz-Edine Assemlal, Luc ...
DGCI
2005
Springer
16 years 5 days ago
Uncertain Geometry in Computer Vision
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
Peter Veelaert