Sciweavers

2814 search results - page 29 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ICANN
2003
Springer
14 years 1 months ago
Expectation-MiniMax Approach to Clustering Analysis
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
Yiu-ming Cheung
SDM
2012
SIAM
297views Data Mining» more  SDM 2012»
11 years 11 months ago
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...
Adam Lugowski, David M. Alber, Aydin Buluç,...
ICALP
2009
Springer
14 years 9 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula