Sciweavers

1333 search results - page 82 / 267
» Not a Number of Floating Point Problems
Sort
View
104
Voted
DAM
1999
88views more  DAM 1999»
15 years 3 months ago
Separable Partitions
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
Noga Alon, Shmuel Onn
135
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...
160
Voted
HOTSWUP
2009
ACM
15 years 7 months ago
Efficient Systematic Testing for Dynamically Updatable Software
Recent years have seen significant advances in dynamic software updating (DSU) systems, which allow programs to be patched on the fly. However, a significant challenge remains: Ho...
Christopher M. Hayden, Eric A. Hardisty, Michael W...
118
Voted
EUROCAST
2005
Springer
86views Hardware» more  EUROCAST 2005»
15 years 9 months ago
Convergence of Iterations
Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions ar...
Paul Cull
JMIV
2006
115views more  JMIV 2006»
15 years 3 months ago
Application of the Fisher-Rao Metric to Structure Detection
Abstract - Certain structure detection problems can be solved by sampling a parameter space for the different structures at a finite number of points and checking each point to see...
Stephen J. Maybank