683 search results - page 16 / 137 » A Fine-grained Analysis of a Simple Independent Set Algorith... |
127
Voted
ESA
1998
Springer
15 years 7 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
128
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
140
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: It is common for the results of a microarray study to be analyzed in the context of biologically-motivated groups of genes such as pathways or Gene Ontology categories...
193
Voted
CORR
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
119
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
We propose a new algorithm for independent component and independent subspace analysis problems. This algorithm uses a contrast based on the Schweizer-Wolff measure of pairwise de...