3247 search results - page 17 / 650 » Randomized smoothing networks |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
NETWORKS
2008
14 years 9 months ago
2008
113
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We propose a novel formulation of stereo matching that considers each pixel as a feature vector. Under this view, matching two or more images can be cast as matching point clouds i...
100
click to vote
DAGSTUHL
2007
14 years 11 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Throughput capacity in wireless ad hoc networks has been studied extensively under many different mobility models such as i.i.d. mobility model, Brownian mobility model, random ...