2638 search results - page 41 / 528 » Random Geometric Complexes |
ICIP
2001
IEEE
16 years 3 months ago
2001
IEEE
This paper presents an efficient method for the estimation and recovering from nonlinear or local geometrical distortions, such as the random bending attack and restricted project...
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...
132
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
125
click to vote
EUSFLAT
2001
15 years 3 months ago
2001
In analogy to the representation of the standard probabilistic average as an expected value of a random variable, a geometric approach to aggregation is proposed. Several properti...
109
click to vote
COMGEO
2004
ACM
15 years 1 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...