1333 search results - page 63 / 267 » Not a Number of Floating Point Problems |
119
Voted
PKDD
2007
Springer
15 years 9 months 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...
125
Voted
JCT
2011
14 years 10 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 ...
111
Voted
CORR
2006
Springer
15 years 3 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...
134
Voted
COLT
2003
Springer
15 years 8 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...
122
Voted
COMPGEOM
1999
ACM
15 years 7 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 ...