10608 search results - page 333 / 2122 » Complexity of O'Hara's Algorithm |
IAJIT
2010
14 years 11 months ago
2010
: One of the fundamental issues in computer science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal o...
107
click to vote
PODS
2008
ACM
16 years 26 days ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
79
Voted
ICMCS
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
115
Voted
BVAI
2005
Springer
15 years 6 months ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
87
Voted
ESA
2008
Springer
15 years 2 months ago
2008
Springer
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...