1176 search results - page 209 / 236 » Sparse reward processes |
DAS
2006
Springer
15 years 3 months ago
2006
Springer
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that complete contains the shape. The best-fit bounding...
115
click to vote
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
Many visual search and matching systems represent images using sparse sets of "visual words": descriptors that have been quantized by assignment to the best-matching symb...
ASPDAC
2008
ACM
15 years 1 months ago
2008
ACM
Nowadays a placement problem often involves multi-million objects and excessive fixed blockages. We present a new global placement algorithm that scales well to the modern large-s...
120
click to vote
DCOSS
2008
Springer
15 years 1 months ago
2008
Springer
Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to ju...
126
Voted
DAGSTUHL
2007
15 years 1 months ago
2007
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing...