165 search results - page 32 / 33 » Straightening and Partitioning Shapes |
KDD
2006
ACM
14 years 7 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
ASSETS
2006
ACM
14 years 1 months ago
2006
ACM
In previous work we have presented a prototype of an assistant system for the blind that can be used for self-localization and interactive object identification of static objects ...
ICCV
2009
IEEE
14 years 11 months ago
2009
IEEE
Segmentation in the surveillance domain has to deal with shadows to avoid distortions when detecting moving objects. Most segmentation approaches dealing with shadow detection are ...
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...