88 search results - page 4 / 18 » Improved Bounds and Schemes for the Declustering Problem |
104
Voted
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
115
Voted
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
NIPS
2008
15 years 1 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
How to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decod...
94
Voted
NIPS
2004
15 years 1 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...