1403 search results - page 33 / 281 » Set cover algorithms for very large datasets |
FSTTCS
2003
Springer
14 years 1 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
BMCBI
2007
13 years 8 months ago
2007
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
NIPS
2000
13 years 9 months ago
2000
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...
ISICA
2007
Springer
14 years 2 months ago
2007
Springer
The latent class model or multivariate multinomial mixture is a powerful model for clustering discrete data. This model is expected to be useful to represent non-homogeneous popula...
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
Clustering is the process of grouping a set of objects into classes of similar objects. Although definitions of similarity vary from one clustering model to another, in most of th...