1333 search results - page 63 / 267 » Not a Number of Floating Point Problems |
146
click to vote
PKDD
2007
Springer
16 years 10 days ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
163
click to vote
JCT
2011
15 years 1 months ago
2011
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz [7], to obtain several sharp bounds on the number of incidences between lines and points in three ...
149
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In vector quantization the number of vectors used to construct the codebook is always an undefined problem, there is always a compromise between the number of vectors and the quan...
177
click to vote
COLT
2003
Springer
15 years 11 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
158
click to vote
COMPGEOM
1999
ACM
15 years 10 months ago
1999
ACM
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...