34 search results - page 3 / 7 » A new approximation algorithm for labeling points with circl... |
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
NIPS
2003
13 years 6 months ago
2003
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
WWW
2004
ACM
14 years 6 months ago
2004
ACM
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...