Sciweavers

6110 search results - page 161 / 1222
» Approximate Computing
Sort
View
CCCG
2007
15 years 8 months ago
Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm
Given a dense sampling S of the smooth boundary of a planar shape O. We show that the medial axis of the union of Voronoi balls centered at Voronoi vertices inside O has a particu...
Joachim Giesen, Balint Miklos, Mark Pauly
DAGSTUHL
2006
15 years 7 months ago
Approximability of Minimum AND-Circuits
Given a set of monomials, the Minimum AND-Circuit problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that t...
Jan Arpe, Bodo Manthey
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 6 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
ORL
2008
88views more  ORL 2008»
15 years 6 months ago
Approximating integrals of multivariate exponentials: A moment approach
We propose a method to calculate lower and upper bounds of some exponential multivariate integrals using moment relaxations and show that they asymptotically converge to the value...
Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasser...
ICPR
2008
IEEE
16 years 27 days ago
Approximation of salient contours in cluttered scenes
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
Rui Huang, Nong Sang, Qiling Tang