6110 search results - page 412 / 1222 » Approximate Computing |
167
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Two new techniques are proposed to improve stereo matching performance in this work. First, to address the disparity discontinuity problem in occluded regions, we present a dispar...
197
click to vote
SGP
2004
15 years 9 months ago
2004
We propose a metric for surface parameterization specialized to its signal that can be used to create more efficient, high-quality texture maps. Derived from Taylor expansion of s...
223
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
221
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
174
click to vote
TCS
2010
15 years 1 months ago
2010
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...