Result 1 to 17 of 17 total
Mobility-assisted minimum connected cover in a wireless sensor network. (English)
J. Parallel Distrib. Comput. 72, No. 7, 827-837 (2012).
1
Effective target tracking mechanism in a self-organizing wireless sensor network. (English)
J. Parallel Distrib. Comput. 71, No. 10, 1318-1326 (2011).
2
Minimum perimeter coverage of query regions in a heterogeneous wireless sensor network. (English)
Inf. Sci. 181, No. 15, 3130-3142 (2011).
3
Finding perimeter of query regions in heterogenous wireless sensor networks (English)
Computing and Informatics 29, No. 5, 801-821 (2010).
4
Nonlinear trajectory discovery of a moving target by wireless sensor networks (English)
Computing and Informatics 29, No. 4, 647-662 (2010).
5
Decomposable algorithms for nearest neighbor computing. (English)
J. Parallel Distrib. Comput. 68, No. 7, 902-912 (2008).
6
A new mechanism for tracking a mobile target using grid sensor networks (English)
Computing and Informatics 27, No. 6, 853-873 (2008).
7
Learning k-nearest neighbors classifier from distributed data (English)
Computing and Informatics 27, No. 3, 355-376 (2008).
8
Sensor replacement based energy mapping (English)
CAINE, 137-143 (2008).
9
Target tracking mechanism for cluster based sensor networks. (English)
Appl. Math. Inf. Sci. 1, No. 3, 287-303 (2007).
10
Agents for integrating distributed data for complex computations. (English)
Comput. Inform. 26, No. 2, 149-170 (2007).
11
Agents for integrating distributed data for complex computations (English)
Computing and Informatics 26, No. 2, 149-170 (2007).
12
A topology discovery algorithm for sensor network using smart antennas. (English)
Comput. Commun. 29, No. 12, 2261-2268 (2006).
13
Adopting knowledge discovery in databases for customer relationship management in Egyptian public banks (English)
IFIP PPAI, 201-208 (2006).
14
Decomposable algorithms for computing minimum spanning tree. (English)
Das, Samir R. (ed.) et al., Distributed computing ‒ IWDC 2003. 5th international workshop, Kolkata, India, December 27‒30, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20745-7/pbk). Lect. Notes Comput. Sci. 2918, 33-44 (2003).
15
Decomposable algorithms for computing minimum spanning tree (English)
IWDC, 33-44 (2003).
16
Finding global paths in distributed and mobile subgraphs (English)
MAICS, 57-63 (2003).
17
Result 1 to 17 of 17 total