2566 search results - page 11 / 514 » The Online Median Problem |
JUCS
2002
13 years 7 months ago
2002
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
RECOMB
2007
Springer
14 years 8 months ago
2007
Springer
In the past decade, genome rearrangements have attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. Methods ...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...