8647 search results - page 1342 / 1730 » The Container Selection Problem |
157
click to vote
IUI
2000
ACM
15 years 9 months ago
2000
ACM
In recent years, many systems and approaches for recommending information, products or other objects have been developed. In these systems, often machine learning methods that nee...
135
click to vote
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
159
click to vote
ICCV
1999
IEEE
15 years 9 months ago
1999
IEEE
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
209
click to vote
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
15 years 8 months ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
158
click to vote
SPAA
1997
ACM
15 years 8 months ago
1997
ACM
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...