Sciweavers

2434 search results - page 130 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
123
Voted
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
15 years 7 months ago
Efficiency of Data Distribution in BitTorrent-Like Systems
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong
JSAC
2008
140views more  JSAC 2008»
15 years 3 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
140
Voted
SIAMJO
2008
117views more  SIAMJO 2008»
15 years 3 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim
SGP
2007
15 years 6 months ago
A streaming algorithm for surface reconstruction
We present a streaming algorithm for reconstructing closed surfaces from large non-uniform point sets based on a geometric convection technique. Assuming that the sample points ar...
Rémi Allègre, Raphaëlle Chaine,...
186
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
A distributed triangulation algorithm for wireless sensor networks on 2D and 3D surface
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...
Hongyu Zhou, Hongyi Wu, Su Xia, Miao Jin, Ning Din...