154 search results - page 24 / 31 » Near Best Tree Approximation |
VTC
2008
IEEE
14 years 1 months ago
2008
IEEE
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—In this paper, we develop passive network tomography techniques for inferring link-level anomalies like excessive loss rates and delay from path-level measurements. Our ...