1161 search results - page 79 / 233 » Approximation schemes for clustering problems |
111
Voted
NIPS
2003
15 years 5 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
135
Voted
NIPS
2004
15 years 5 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...
120
Voted
IJPP
2008
15 years 3 months ago
2008
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...
118
Voted
WMPI
2004
ACM
15 years 9 months ago
2004
ACM
Clustered microarchitectures are an effective organization to deal with the problem of wire delays and complexity by partitioning some of the processor resources. The organization ...
123
Voted
ICAC
2007
IEEE
15 years 10 months ago
2007
IEEE
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...