Sciweavers

CSR
2008
Springer
14 years 2 months ago
Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
Eric Allender
COMPGEOM
2009
ACM
14 years 5 months ago
k-means requires exponentially many iterations even in the plane
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....
Andrea Vattani