403 search results - page 63 / 81 » Sampling Bounds for Stochastic Optimization |
EGH
2010
Springer
13 years 7 months ago
2010
Springer
Current GPUs rasterize micropolygons (polygons approximately one pixel in size) inefficiently. Additionally, they do not natively support triangle rasterization with jittered samp...
ICALP
2010
Springer
13 years 12 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
COLT
2008
Springer
13 years 11 months ago
2008
Springer
In this paper, we investigate stability-based methods for cluster model selection, in particular to select the number K of clusters. The scenario under consideration is that clust...
WSC
2004
13 years 11 months ago
2004
In this paper, we consider the fast simulation of traffic groomed optical networks, in which multiple sub-rate traffic streams may be carried on the same wavelength. For real-size...
ICRA
2010
IEEE
13 years 8 months ago
2010
IEEE
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...