Sciweavers

2190 search results - page 290 / 438
» Incomplete Information Processing for Optimization of Distri...
Sort
View
IPSN
2005
Springer
15 years 4 months ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry
PPOPP
1997
ACM
15 years 3 months ago
Compiling Dynamic Mappings with Array Copies
Array remappings are useful to many applications on distributed memory parallel machines. They are available in High Performance Fortran, a Fortran-based data-parallel language. T...
Fabien Coelho
MOBIDE
2010
ACM
14 years 11 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
MM
2005
ACM
134views Multimedia» more  MM 2005»
15 years 4 months ago
Formulating context-dependent similarity functions
Tasks of information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be formulated in a con...
Gang Wu, Edward Y. Chang, Navneet Panda
DGO
2007
150views Education» more  DGO 2007»
15 years 22 days ago
Event-triggered data and knowledge sharing among collaborating government organizations
Solving complex global problems such as illegal immigration, border control, and terrorism requires government organizations at all levels to share not only data but, more importa...
Seema Degwekar, Jeff DePree, Howard W. Beck, Carla...