Search results for "K-clustering"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore	A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric.	Euro-Par	2009	DBLP DOI BibTeX RDF	K-clustering, self-stabilization, weighted graph
3	Yaacov Fernandess, Dahlia Malkhi	K-clustering in wireless ad hoc networks.	POMC	2002	DBLP DOI BibTeX RDF	k-clustering, distributed algorithm, wireless ad hoc networks, connected dominating set, competitive ratio
2	Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore	A Self-Stabilizing O(n)-Round k-Clustering Algorithm.	SRDS	2009	DBLP DOI BibTeX RDF	K-dominating set, K-clustering, silent, self-stabilization, unfair scheduler
2	Stefano Gualandi	k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach.	CPAIOR	2009	DBLP DOI BibTeX RDF
2	Dongbo Zhang, Yaonan Wang	Rough Neural Network Based on Bottom-Up Fuzzy Rough Data Analysis.	Neural Processing Letters	2009	DBLP DOI BibTeX RDF	Gaustafason-Kessel (G-K) clustering, Fuzzy rough data model, Rough logic neural network, Rough sets
2	Artur Czumaj, Christian Sohler	Small Space Representations for Metric Min-Sum k -Clustering and Their Applications.	STACS	2007	DBLP DOI BibTeX RDF
2	Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Schulte, Hui Xiong	The minimum consistent subset cover problem and its applications in data mining.	KDD	2007	DBLP DOI BibTeX RDF	converse k-clustering, minimum consistent subset cover, minimum rule set, pattern summarization
2	Vlady Ravelomanana	Distributed k-Clustering Algorithms for Random Wireless Multihop Networks.	ICN	2005	DBLP DOI BibTeX RDF
2	Rafail Ostrovsky, Yuval Rabani	Polynomial Time Approximation Schemes for Geometric k-Clustering.	FOCS	2000	DBLP DOI BibTeX RDF	geometric k-clustering, data point clustering, data set partitioning, high dimensional geometry, binary cube, computational complexity, computational geometry, Hamming distance, NP-hard problem, distance function, polynomial time approximation schemes, pattern clustering, k-median problem
2	Mary Inaba, Naoki Katoh, Hiroshi Imai	Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract).	Symposium on Computational Geometry	1994	DBLP DOI BibTeX RDF
2	Amitava Datta	Efficient Parallel Algorithms for Geometric k-Clustering Problems.	STACS	1994	DBLP DOI BibTeX RDF
1	Vicente Acuña, C. E. Ferreira, Alexandre S. Freire, Eduardo Moreno	The biclique k-clustering problem in bipartite graphs and its application in bioinformatics.	Electronic Notes in Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore	A self-stabilizing k-clustering algorithm for weighted graphs.	J. Parallel Distrib. Comput.	2010	DBLP DOI BibTeX RDF
1	Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula	A Self-Stabilizing O(k)-Time k-Clustering Algorithm.	Comput. J.	2010	DBLP DOI BibTeX RDF
1	Artur Czumaj, Christian Sohler	Small Space Representations for Metric Min-sum k-Clustering and Their Applications.	Theory Comput. Syst.	2010	DBLP DOI BibTeX RDF
1	Pankaj Kumar, Piyush Kumar	Almost Optimal Solutions to k-Clustering Problems.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	José Luis Castillo Sequera, José R. Fernández del Castillo, León González-Sotos	Algorithms of Machine Learning for K-Clustering.	PAAMS (Special Sessions and Workshops)	2010	DBLP DOI BibTeX RDF
1	Stefano Gualandi, Francesco Maffioli, Claudio Magni	A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem.	CTW	2010	DBLP BibTeX RDF
1	Asaf Levin	A generalized minimum cost k-clustering.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF
1	Mohammad Reza Dehghani, Hassan Samavarchi, Noushin Mahdiyan	The Intelligent Dismantling of the Electronic Check Based on the k Clustering Algorithm in Data Searching.	CSIE	2009	DBLP DOI BibTeX RDF
1	Haibo Hu, Jianliang Xu	Non-Exposure Location Anonymity.	ICDE	2009	DBLP DOI BibTeX RDF
1	A. K. Upadhayay, Abhijat Agarwal, Rachita Masand, Rajeev Gupta	Privacy Preserving Data Mining: A New Methodology for Data Transformation.	IHCI	2009	DBLP DOI BibTeX RDF
1	Safwat H. Hamad, Tahany A. Fergany, Reda A. Ammar, Amal A. Abd El-Raouf	A Double K-Clustering Approach for restructuring Distributed Object-Oriented software.	ISCC	2008	DBLP DOI BibTeX RDF
1	Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan	On Metric Clustering to Minimize the Sum of Radii.	SWAT	2008	DBLP DOI BibTeX RDF	k-clustering, k-cover, metric clustering, planar metric, clustering, doubling metric
1	Asaf Levin	Approximating min-max k-clustering.	Fair Division	2007	DBLP BibTeX RDF
1	Dongbo Zhang, Yaonan Wang	Fuzzy Rough Modeling Approach: Based on Fuzzy Clustering and GA Search Strategy.	FSKD	2007	DBLP DOI BibTeX RDF
1	Dongbo Zhang, Yaonan Wang, Huixian Huang	Rough Neural Network Modeling Through Supervised G-K Fuzzy Clustering.	SNPD	2007	DBLP DOI BibTeX RDF
1	Geetha Jagannathan, Krishnan Pillaipakkamnatt, Rebecca N. Wright	A New Privacy-Preserving Distributed k-Clustering Algorithm.	SDM	2006	DBLP BibTeX RDF
1	Seohoon Jin, MyungWoo Nam, Sang-Tae Han	Improvements on Common Vector Approach Using k-Clustering Method.	PKAW	2006	DBLP DOI BibTeX RDF
1	Giacomo Angione, Paolo Bellavista, Antonio Corradi, Eugenio Magistretti	A k-hop Clustering Protocol for Dense Mobile Ad-Hoc Networks.	ICDCS Workshops	2006	DBLP DOI BibTeX RDF
1	Zhaoshui He, Shengli Xie, Yuli Fu	Sparse representation and blind source separation of ill-posed mixtures.	Science in China Series F: Information Sciences	2006	DBLP DOI BibTeX RDF	ill-posed mixture, PCA, blind source separation, K-mean clustering, sparse representation
1	Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos	Geometric Clustering to Minimize the Sum of Cluster Sizes.	ESA	2005	DBLP DOI BibTeX RDF
1	Chinnappan Jayakumar, Chenniappan Chellappan	Associativity Based Mobility-Adaptive K-Clustering in Mobile Ad-Hoc Networks.	CIT	2004	DBLP DOI BibTeX RDF
1	Chaitanya Swamy	Correlation Clustering: maximizing agreements via semidefinite programming.	SODA	2004	DBLP DOI BibTeX RDF
1	Artur Czumaj, Christian Sohler	Sublinear-Time Approximation for Clustering Via Random Sampling.	ICALP	2004	DBLP DOI BibTeX RDF
1	Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani	Approximation schemes for clustering problems.	STOC	2003	DBLP DOI BibTeX RDF
1	Qin Ding, Maleq Khan, Amalendu Roy, William Perrizo	The P-tree algebra.	SAC	2002	DBLP DOI BibTeX RDF	Peano ordering, quadrant, compression, spatial data, tree structure
1	Sanjoy Dasgupta	Performance Guarantees for Hierarchical Clustering.	COLT	2002	DBLP DOI BibTeX RDF
1	Attila Pór, Pavel Valtr	The Partitioned Version of the Erdös - Szekeres Theorem.	Discrete & Computational Geometry	2002	DBLP DOI BibTeX RDF
1	Yair Bartal, Moses Charikar, Danny Raz	Approximating min-sum k-clustering in metric spaces.	STOC	2001	DBLP DOI BibTeX RDF
1	Jirí Matousek	On Approximate Geometric k-Clustering.	Discrete & Computational Geometry	2000	DBLP DOI BibTeX RDF