613 search results - page 49 / 123 » Generalized Traveling Salesman Problem Reduction Algorithms |
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
HPCC
2011
Springer
12 years 7 months ago
2011
Springer
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
STOC
1987
ACM
13 years 11 months ago
1987
ACM
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope w...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...