CORR
2011
Springer
12 years 8 months ago
2011
Springer
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
PVLDB
2010
13 years 2 months ago
2010
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
MST
2002
13 years 4 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
ESA
1999
Springer
13 years 8 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...