70 search results - page 7 / 14 » Further refinement of pairing computation based on Miller's ... |
GD
2009
Springer
15 years 2 months ago
2009
Springer
We show that each quadrangulation on n vertices has a closed rectangle of influence drawing on the (n − 2) × (n − 2) grid. Further, we present a simple algorithm to obtain a...
91
Voted
SMA
2008
ACM
14 years 9 months ago
2008
ACM
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
140
click to vote
CVPR
2012
IEEE
13 years 1 days ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
SIAMSC
2010
14 years 8 months ago
2010
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...