562 search results - page 97 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
SIGMOD
2010
ACM
14 years 24 days ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
DAC
2007
ACM
14 years 9 months ago
2007
ACM
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
LATIN
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
IJACT
2008
13 years 8 months ago
2008
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...