Sciweavers

1176 search results - page 209 / 236
» Sparse reward processes
Sort
View
DAS
2006
Springer
14 years 2 months ago
Finding the Best-Fit Bounding-Boxes
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...
Bo Yuan, Leong Kwoh, Chew Lim Tan
ECCV
2010
Springer
14 years 20 days ago
Descriptor Learning for Efficient Retrieval
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
126views Hardware» more  ASPDAC 2008»
14 years 20 days ago
DPlace2.0: A stable and efficient analytical placement based on diffusion
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...
Tao Luo, David Z. Pan
DCOSS
2008
Springer
14 years 13 days ago
Efficient Node Discovery in Mobile Wireless Sensor Networks
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...
Vladimir Dyo, Cecilia Mascolo
DAGSTUHL
2007
14 years 3 days ago
Convergence of iterative aggregation/disaggregation methods based on splittings with cyclic iteration matrices
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing...
Ivo Marek, Ivana Pultarová, Petr Mayer