613 search results - page 55 / 123 » Generalized Traveling Salesman Problem Reduction Algorithms |
KDD
2010
ACM
13 years 9 months ago
2010
ACM
Dimensionality reduction plays an important role in many data mining applications involving high-dimensional data. Many existing dimensionality reduction techniques can be formula...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
EUROCRYPT
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so tha...
TIT
2008
13 years 7 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
A large family of algorithms for dimensionality reduction end with solving a Trace Ratio problem in the form of arg maxW Tr(WT SpW)/Tr(WT SlW)1 , which is generally transformed in...