2252 search results - page 237 / 451 » Improving Random Forests |
115
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satisfying quality of ...
138
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
255
click to vote
WINET
2002
15 years 3 months ago
2002
Abstract. TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless netwo...
128
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
146
click to vote
ESANN
2006
15 years 4 months ago
2006
In this article, we extend a local prototype-based learning model by active learning, which gives the learner the capability to select training samples during the model adaptation...