Sciweavers

14548 search results - page 2510 / 2910
» The Optimal Path-Matching Problem
Sort
View
IWCMC
2006
ACM
16 years 23 days ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
INFOCOM
2005
IEEE
16 years 12 days ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
INFOCOM
2005
IEEE
16 years 12 days ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
CVBIA
2005
Springer
16 years 10 days ago
A New Coarse-to-Fine Framework for 3D Brain MR Image Registration
Registration, that is, the alignment of multiple images, has been one of the most challenging problems in the field of computer vision. It also serves as an important role in biome...
Terrence Chen, Thomas S. Huang, Wotao Yin, Xiang S...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
16 years 9 days ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed
« Prev « First page 2510 / 2910 Last » Next »