1333 search results - page 17 / 267 » Not a Number of Floating Point Problems |
SODA
2004
ACM
15 years 4 months ago
2004
ACM
How many ways can a rectangle be partitioned into smaller ones? We study two variants of this problem: when the partitions are constrained to lie on n given points (no two of whic...
157
Voted
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
The problem of reconstructing a region from a set of sample points is common in many geometric applications, including computer vision. It is very helpful to be able to guarantee ...
113
Voted
DAGSTUHL
2006
15 years 4 months ago
2006
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomia...
141
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
149
click to vote
ICTAI
2008
IEEE
15 years 10 months ago
2008
IEEE
The main challenge of cluster analysis is that the number of clusters or the number of model parameters is seldom known, and it must therefore be determined before clustering. Bay...