Sciweavers

951 search results - page 32 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
ICIP
2002
IEEE
15 years 12 months ago
Full search content independent block matching based on the fast Fourier transform
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
Mark S. Drew, Steven L. Kilthau, Torsten Möll...
SIAMSC
2008
151views more  SIAMSC 2008»
14 years 10 months ago
Accurate Floating-Point Summation Part I: Faithful Rounding
Given a vector of floating-point numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s, i.e. the result is one of the immediate floating-point ...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi
ISBI
2007
IEEE
15 years 4 months ago
An Effective and Efficient Technique for Searching for Similar Brain Activation Patterns
In this paper, we introduce a new approach for content-based similarity search for brain images. Based on the keyblock representation, our framework employs the Principal Componen...
Jingjing Zhang, Vasileios Megalooikonomou
SUM
2007
Springer
15 years 4 months ago
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...
Mónica Caniupán Marileo, Leopoldo E....
COMPGEOM
2007
ACM
15 years 2 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary