613 search results - page 106 / 123 » Generalized Traveling Salesman Problem Reduction Algorithms |
IJISEC
2007
14 years 11 months ago
2007
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this ty...
KDD
2006
ACM
16 years 5 days ago
2006
ACM
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...
DAC
2006
ACM
16 years 22 days ago
2006
ACM
Deploying multiple supply voltages (multi-Vdds) on one chip is an important technique to reduce dynamic power consumption. In this work we present an optimality study for resource...
104
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
102
Voted
STOC
2009
ACM
16 years 11 days ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...