3875 search results - page 320 / 775 » Approximation algorithms for the 0-extension problem |
174
click to vote
EOR
2002
15 years 6 months ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
240
click to vote
JMLR
2010
15 years 1 months ago
2010
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
182
click to vote
PODS
2002
ACM
16 years 7 months ago
2002
ACM
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
169
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
231
click to vote
COMGEO
2012
ACM
14 years 2 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...