951 search results - page 75 / 191 » On the Computation of Correctly-Rounded Sums |
145
click to vote
ICCTA
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
132
click to vote
ICCSA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper presents a new fast and local method of 3D surface reconstruction for scattered data. The algorithm makes use of quasiinterpolants to compute the control point...
149
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
141
click to vote
WG
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
143
click to vote
CGI
2004
IEEE
15 years 7 months ago
2004
IEEE
Using motion capture systems to animate humanlike figures still remains difficult when the movements are complex or need to be adapted to geometric constraints. We propose a new m...