Sciweavers

278 search results - page 6 / 56
» Discrete Approximations to Continuous Curves
Sort
View
NIPS
2008
13 years 8 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan
ECCV
2008
Springer
14 years 9 months ago
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...
Maria Klodt, Thomas Schoenemann, Kalin Kolev, Mare...
SCALESPACE
2001
Springer
13 years 11 months ago
Gaussian Convolutions. Numerical Approximations Based on Interpolation
Abstract. Gaussian convolutions are perhaps the most often used image operators in low-level computer vision tasks. Surprisingly though, there are precious few articles that descri...
Rein van den Boomgaard, Rik van der Weij
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 7 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson
COMPGEOM
2005
ACM
13 years 9 months ago
Inequalities for the curvature of curves and surfaces
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
David Cohen-Steiner, Herbert Edelsbrunner