2252 search results - page 233 / 451 » Improving Random Forests |
150
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
143
Voted
SIAMAM
2011
14 years 6 months ago
2011
In wireless networks, the channels are often subject to random variations that limit the reliability of communications between any two radios. Geographic transmission strategies ca...
170
Voted
ALT
2011
Springer
14 years 3 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
210
Voted
DCOSS
2011
Springer
14 years 3 months ago
2011
Springer
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
158
click to vote
HPCA
2012
IEEE
13 years 11 months ago
2012
IEEE
The least recently used (LRU) replacement policy performs poorly in the last-level cache (LLC) because temporal locality of memory accesses is filtered by first and second level...