1419 search results - page 141 / 284 » A Characterization of Constructive Dimension |
136
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
136
click to vote
SSDBM
1999
IEEE
15 years 9 months ago
1999
IEEE
On-Line Analytical Processing (OLAP) technologies are being used widely, but the lack of effective means of handling data imprecision, which occurs when exact values are not known...
195
click to vote
STOC
1998
ACM
15 years 9 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
154
click to vote
ICSE
1997
IEEE-ACM
15 years 8 months ago
1997
IEEE-ACM
-- Reuse of large-grain software components offers the potential for significant savings in application development cost and time. Successful component reuse and substitutability ...
170
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...