494 search results - page 52 / 99 » Optimal Carpet Cutting |
114
click to vote
IM
2007
14 years 11 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
121
click to vote
MIR
2010
ACM
15 years 3 months ago
2010
ACM
Mobile devices are increasingly powerful in media storage and rendering. The prevalent request of decent video browsing on mobile devices is demanding. However, one limitation com...
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
We consider the problem of performance driven lookup-table (LUT) based technology mapping for FPGAs using a general delay model. In the general delay model, each interconnection e...
ICCV
2005
IEEE
16 years 1 months ago
2005
IEEE
Occlusion is one of the challenging problems in stereo. In this paper, we solve the problem in a segment-based style. Both images are segmented, and we propose a novel patchbased ...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic whic...