796 search results - page 100 / 160 » Approximating the centroid is hard |
STOC
2010
ACM
14 years 16 days ago
2010
ACM
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
SIGECOM
2010
ACM
14 years 15 days ago
2010
ACM
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
SIGMOD
2010
ACM
14 years 15 days ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...