817 search results - page 24 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
We study the cosegmentation problem where the objective
is to segment the same object (i.e., region) from a pair
of images. The segmentation for each image can be cast
using a p...
SCALESPACE
1999
Springer
14 years 27 days ago
1999
Springer
Abstract. Multiresolution techniques are often used to shorten the execution times of dynamic programming based deformable contour optimization methods by decreasing the image reso...
ASPDAC
2006
ACM
14 years 2 months ago
2006
ACM
— Buffer insertion is an effective technique to reduce interconnect delay. In this paper, we give a simple O(mn) time algorithm for optimal buffer insertion, where m is the numbe...
TSP
2008
13 years 8 months ago
2008
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...