Sciweavers

169 search results - page 26 / 34
» Application of computational geometry to network p-center lo...
Sort
View
DCOSS
2010
Springer
15 years 26 days ago
Data Spider: A Resilient Mobile Basestation Protocol for Efficient Data Collection in Wireless Sensor Networks
Traditional deployments of wireless sensor networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, su...
Onur Soysal, Murat Demirbas
73
Voted
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
12 years 12 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
GIS
2009
ACM
15 years 1 months ago
Dynamic network data exploration through semi-supervised functional embedding
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...
Alexei Pozdnoukhov
93
Voted
CGI
2006
IEEE
15 years 3 months ago
Providing Full Awareness to Distributed Virtual Environments Based on Peer-to-Peer Architectures
In recent years, large scale distributed virtual environments (DVEs) have become a major trend in distributed applications, mainly due to the enormous popularity of multiplayer onl...
Pedro Morillo, W. Moncho, Juan M. Orduña, J...
WONS
2005
IEEE
15 years 3 months ago
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
Alexander Kesselman, Dariusz R. Kowalski