209 search results - page 34 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
112
click to vote
CVPR
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a new, robust and computationally efficient method for estimating the probability density of the intensity values in an image. Our approach makes use of a continuous r...
STACS
2001
Springer
15 years 1 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Dynamic networks, e.g. Mobile Ad Hoc Networks (MANETs), call for adaptive protocols that can tolerate topological changes due to nodes’ mobility and depletion of battery power. ...
ICPP
1998
IEEE
15 years 1 months ago
1998
IEEE
The postal network is an interconnection network that possesses many desirable properties which are important in network design and applications. It includes hypercubes and Fibona...
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...