4110 search results - page 468 / 822 » Efficient algorithms for the 2-gathering problem |
184
click to vote
ICMCS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper a novel method for view independent human movement representation and recognition, exploiting the rich information contained in multi-view videos, is proposed. The bi...
210
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
167
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, the problem of estimating automatically the symmetry plane of bilateral objects (having perfect or imperfect mirror symmetry) in point clouds is reexamined. Classic...
158
click to vote
TON
2008
15 years 6 months ago
2008
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
173
click to vote
TWC
2008
15 years 6 months ago
2008
In wireless ad hoc networks, autonomous nodes are reluctant to forward others' packets because of the nodes' limited energy. However, such selfishness and noncooperation ...