824 search results - page 38 / 165 » Efficient Distance Computation Between Non-Convex Objects |
RSS
2007
13 years 9 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
BMVC
2010
13 years 6 months ago
2010
We present a method for live grouping of feature points into persistent 3D clusters as a single camera browses a static scene, with no additional assumptions, training or infrastr...
HPCA
2008
IEEE
14 years 8 months ago
2008
IEEE
Cache partitioning and sharing is critical to the effective utilization of multicore processors. However, almost all existing studies have been evaluated by simulation that often ...
Publication
Round-trips between home and work represent, for the majority of people, most of their daily
commuting time; also, setting home and work places involves more constraints for two- ...
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
In an object recognition scenario with tens of thousands of categories, even a small number of labels per category leads to a very large number of total labels required. We propose...