307 search results - page 17 / 62 » A Comparison of Algorithms for Connected Set Openings and Cl... |
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
INFOCOM
2011
IEEE
12 years 10 months ago
2011
IEEE
Abstract—Triangulation serves as the basis for many geometrybased algorithms in wireless sensor networks. In this paper we propose a distributed algorithm that produces a triangu...
ESANN
2006
13 years 8 months ago
2006
Neural gas (NG) constitutes a very robust clustering algorithm which can be derived as stochastic gradient descent from a cost function closely connected to the quantization error...
INFOCOM
1991
IEEE
13 years 11 months ago
1991
IEEE
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
COCO
2004
Springer
14 years 24 days ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....