1632 search results - page 179 / 327 » Sublinear Time Algorithms for Metric Space Problems |
136
click to vote
ICDCS
2000
IEEE
15 years 8 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
141
click to vote
AUSDM
2008
Springer
15 years 6 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
134
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
144
click to vote
SIGMETRICS
2003
ACM
15 years 9 months ago
2003
ACM
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
143
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...