STOC
1998
ACM
14 years 3 months ago
1998
ACM
STOC
1998
ACM
14 years 3 months ago
1998
ACM
STOC
1998
ACM
14 years 3 months ago
1998
ACM
In heterogeneousnetworks sending messagesmay incur different delayson different edges,and eachprocessormay havea different switching timebetweenmessages.Thewell studiedTelephonemo...
STOC
1998
ACM
14 years 3 months ago
1998
ACM
STOC
1998
ACM
14 years 3 months ago
1998
ACM
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
STOC
1998
ACM
14 years 3 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
STOC
1998
ACM
14 years 3 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
SPAA
1998
ACM
14 years 3 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
SIGIR
1998
ACM
14 years 3 months ago
1998
ACM
We discuss two learning algorithms for text filtering: modified Rocchio and a boosting algorithm called AdaBoost. We show how both algorithms can be adapted to maximize any gene...
CPM
1998
Springer
14 years 3 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...