2194 search results - page 148 / 439 » Improving HLRTA*( k ) |
133
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
111
click to vote
NIPS
2003
15 years 3 months ago
2003
We investigate improvements of AdaBoost that can exploit the fact that the weak hypotheses are one-sided, i.e. either all its positive (or negative) predictions are correct. In pa...
COMGEO
2010
ACM
15 years 1 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
107
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, the ergodic sum-rate and outage probability of a downlink single-antenna channel with K users are analyzed in the presence of Rayleigh flat fading, where limited cha...
130
click to vote
IM
2007
15 years 1 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...