3441 search results - page 480 / 689 » Intelligent Computation of Presentation Documents |
237
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
231
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
206
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
—Identification of the correct number of clusters and the corresponding partitioning are two important considerations in clustering. In this paper, a newly developed point symme...
176
click to vote
ICTAI
2007
IEEE
16 years 1 months ago
2007
IEEE
The ability of an algorithm to accurately estimate the parameters of the geometric transformation which aligns two image profiles even in the presence of photometric distortions ...
176
click to vote
AIIA
2007
Springer
16 years 1 months ago
2007
Springer
This paper describes a similarity measure for images to be used in image-based localization for autonomous robots with low computational resources. We propose a novel signature to ...