CIKM
2000
Springer
14 years 4 months ago
2000
Springer
Recently there has been significant interest in supervised learning algorithms that combine labeled and unlabeled data for text learning tasks. The co-training setting [1] applie...
CIKM
2000
Springer
14 years 4 months ago
2000
Springer
We examine applications of clustering to the filtering task. We use the on-line version of the star algorithm [JPR98, JPR99] as the clustering tool because this algorithm compute...
CIAC
2000
Springer
14 years 4 months ago
2000
Springer
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
CIAC
2000
Springer
14 years 4 months ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
CIAC
2000
Springer
14 years 4 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
CIAC
2000
Springer
14 years 4 months ago
2000
Springer
CIAC
2000
Springer
14 years 4 months ago
2000
Springer
CIAC
2000
Springer
14 years 4 months ago
2000
Springer
ASIAN
2000
Springer
14 years 4 months ago
2000
Springer
ASIAN
2000
Springer
14 years 4 months ago
2000
Springer
