260 search results - page 43 / 52 » Quality guarantees for region optimal DCOP algorithms |
127
Voted
AVBPA
1997
Springer
15 years 6 months ago
1997
Springer
In this paper we describe a system to reliably localize the position of the speaker’s face and mouth in videophone sequences. A statistical scheme based on a subspace method is p...
119
click to vote
CVPR
2000
IEEE
16 years 3 months ago
2000
IEEE
In this work, we approach the classic Mumford-Shah problem from a curve evolution perspective. In particular, we let a given family of curves define the boundaries between regions...
115
click to vote
ICCAD
2009
IEEE
14 years 11 months ago
2009
IEEE
Dramatic progress has been made in algorithms for placement and routing over the last 5 years, with improvements in both speed and quality. Combining placement and routing into a ...
127
click to vote
TCAD
2008
15 years 1 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
145
click to vote
FOCS
2010
IEEE
14 years 12 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...