951 search results - page 68 / 191 » On the Computation of Correctly-Rounded Sums |
101
click to vote
TSMC
2008
15 years 3 months ago
2008
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
116
Voted
COMBINATORICS
2000
15 years 3 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
132
click to vote
CGF
2002
15 years 3 months ago
2002
Meshes have become a widespread and popular representation of models in computer graphics. Morphing techniques aim at transforming a given source shape into a target shape. Morphi...
135
Voted
HEURISTICS
2002
15 years 3 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
109
click to vote
DM
1999
15 years 3 months ago
1999
Pascal's rhombus is a variation of Pascal's triangle in which values are computed as the sum of four terms, rather than two. It is shown that the limiting ratio of the n...