104 search results - page 8 / 21 » Tight Bounds for Point Recolouring |
100
click to vote
SODA
2008
ACM
14 years 11 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
TVCG
1998
14 years 9 months ago
1998
This paper presents a new approach to rendering triangular algebraic free form surfaces. A hierarchical subdivision of the surface with associated tight bounding volumes provides ...
118
click to vote
DMTCS
2010
14 years 6 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
TWC
2010
14 years 4 months ago
2010
Abstract-- This paper studies a statistical distribution of instantaneous power in pulse-shaped single-carrier (SC) modulation. Such knowledge is of significant importance to estim...
SIAMCO
2002
14 years 9 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...