Sciweavers

5595 search results - page 114 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
15 years 10 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
ICPR
2008
IEEE
15 years 11 months ago
Combining hierarchical clusterings using min-transitive closure
In the past, clusterings combination approaches are based on “flat” clustering algorithms, i.e. algorithms that operate on non-hierarchical clustering schemes. These approache...
Abdolreza Mirzaei, Mohammad Rahmati
CSB
2005
IEEE
115views Bioinformatics» more  CSB 2005»
15 years 10 months ago
A New Clustering Strategy with Stochastic Merging and Removing Based on Kernel Functions
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
Huimin Geng, Hesham H. Ali
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
16 years 5 months ago
Frequent term-based text clustering
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
Florian Beil, Martin Ester, Xiaowei Xu
INFOCOM
2009
IEEE
15 years 11 months ago
Approximation Algorithms for Data Broadcast in Wireless Networks
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...
Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu,...