3875 search results - page 604 / 775 » Approximation algorithms for the 0-extension problem |
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
159
click to vote
TON
2008
15 years 6 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
212
click to vote
SIGMOD
2010
ACM
15 years 11 months 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...
159
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
171
click to vote
GECCO
2010
Springer
15 years 10 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...