253 search results - page 45 / 51 » Faster Approximation of Distances in Graphs |
109
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
109
click to vote
DATE
2006
IEEE
15 years 9 months ago
2006
IEEE
Conventional high-level synthesis uses the worst case delay to relate all inputs to all outputs of an operation. This is a very conservative approximation of reality, especially i...
146
Voted
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper presents an efficient algorithm for image segmentation and a framework for perceptual grouping. It makes an attempt to provide one way of combining bottomup and top-do...
149
Voted
SODA
2010
ACM
16 years 28 days ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
131
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...