2252 search results - page 275 / 451 » Improving Random Forests |
116
click to vote
TON
2010
14 years 11 months ago
2010
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
119
Voted
TIT
2010
14 years 7 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
114
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
152
click to vote
PLDI
2011
ACM
14 years 3 months ago
2011
ACM
Compilers should be correct. To improve the quality of C compilers, we created Csmith, a randomized test-case generation tool, and spent three years using it to find compiler bug...
120
click to vote
APPROX
2011
Springer
14 years 24 days ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...