2137 search results - page 267 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
191
click to vote
EMMCVPR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
168
click to vote
PAMI
2011
15 years 1 months ago
2011
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
156
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
176
click to vote
UAI
2000
2000
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
15 years 7 months ago
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...
180
click to vote
WSCG
2004
15 years 7 months ago
2004
Several sophisticated methods are available for efficient rendering of out-of-core terrain data sets. For huge data sets the use of preprocessed tiles has proven to be more effici...