3092 search results - page 26 / 619 » Where are you pointing |
154
click to vote
EOR
2007
15 years 5 months ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proļ...
188
click to vote
CVPR
1996
IEEE
16 years 7 months ago
1996
IEEE
This paper addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters between two sets of 3-D points are to be recovered. The existe...
147
Voted
CGI
2001
IEEE
15 years 9 months ago
2001
IEEE
30 digitization devices produce very large sets of 3 0 points sampled from the suqaces of the objects being scanned. A mesh construction procedure needs to be:upplied to derive po...
164
click to vote
SSIAI
2002
IEEE
15 years 10 months ago
2002
IEEE
Point matching is the task of ļ¬nding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
164
click to vote
ISCC
2009
IEEE
16 years 8 days ago
2009
IEEE
ā A well-known approach to increase the resilience of mobile ad hoc networks (MANETs) and unstructured sensor networks is to ensure a network topology where there are at least k ...