4266 search results - page 759 / 854 » The container loading problem |
FOCS
1999
IEEE
14 years 4 days 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...
ICCV
1999
IEEE
14 years 4 days 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...
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
14 years 3 days 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...
SPAA
1997
ACM
14 years 1 days ago
1997
ACM
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
CHI
1996
ACM
14 years 5 hour ago
1996
ACM
Email is one of the most successful computer applications yet devised. Our empirical data show however, that although email was originally designed as a communications application...