Sciweavers

1333 search results - page 17 / 267
» Not a Number of Floating Point Problems
Sort
View
66
Voted
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 1 months ago
On the number of rectangular partitions
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...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
132
Voted
COMGEO
2012
ACM
13 years 8 months ago
Preserving geometric properties in reconstructing regions from internal and nearby points
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 ...
Ernest Davis
86
Voted
DAGSTUHL
2006
15 years 2 months ago
Probabilistically Stable Numerical Sparse Polynomial Interpolation
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...
Mark Giesbrecht, George Labahn, Wen-shin Lee
115
Voted
COMPGEOM
2008
ACM
15 years 2 months ago
Extremal problems on triangle areas in two and three dimensions
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, ...
Adrian Dumitrescu, Micha Sharir, Csaba D. Tó...
ICTAI
2008
IEEE
15 years 7 months ago
Knee Point Detection on Bayesian Information Criterion
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...
Qinpei Zhao, Mantao Xu, Pasi Fränti