Sciweavers

130 search results - page 2 / 26
» XQL and proximal nodes
Sort
View
JGAA
2010
74views more  JGAA 2010»
14 years 8 months ago
Efficient, Proximity-Preserving Node Overlap Removal
Emden R. Gansner, Yifan Hu
TMC
2010
167views more  TMC 2010»
14 years 4 months ago
Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
Ryo Sugihara, Rajesh K. Gupta
ICIP
2009
IEEE
14 years 7 months ago
Robust object tracking using correspondence voting for smart surveillance visual sensing nodes
This paper presents a bottom-up tracking algorithm for surveillance applications where speed and reliability in the case of multiple matches and occlusions are major concerns. The...
Mayssaa Al Najjar, Soumik Ghosh, Magdy Bayoumi
DCOSS
2005
Springer
15 years 3 months ago
Distributed Proximity Maintenance in Ad Hoc Mobile Networks
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
Jie Gao, Leonidas J. Guibas, An Nguyen
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
15 years 10 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky