562 search results - page 42 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
114
click to vote
INFOCOM
2012
IEEE
13 years 4 days ago
2012
IEEE
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
ATS
2000
IEEE
15 years 2 months ago
2000
IEEE
Testing of embedded cores is very difficult in SOC (system-on-a-chip), since the core user may not know the gate level implementation of the core, and the controllability and obse...
112
click to vote
ICIP
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper proposes a face recognition system that uses (i) passive stereo vision to capture three-dimensional (3D) facial information and (ii) 3D matching using a simple ICP (...
MOBIHOC
2010
ACM
14 years 7 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
CLEF
2010
Springer
14 years 10 months ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...