✦ LIBER ✦

An Algorithm for Discovery

✍ Scribed by Paydarfar, D.

Book ID: 121163592
Publisher: American Association for the Advancement of Science
Year: 2001
Tongue: English
Weight: 218 KB
Volume: 292
Category: Article
ISSN: 0036-8075
DOI: 10.1126/science.292.5514.13

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Iterative Algorithm for Motif Discove

An Iterative Algorithm for Motif Discovery

✍ Fan, Yetian; Wu, Wei; Liu, Rongrong; Yang, Wenyu 📂 Article 📅 2013 🏛 Elsevier 🌐 English ⚖ 99 KB

An asynchronous neighbor discovery algor

An asynchronous neighbor discovery algorithm for wireless sensor networks

✍ Steven A. Borbash; Anthony Ephremides; Michael J. McGlynn 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 580 KB

We consider the problem of determining, in a distributed, asynchronous and scalable manner, what nodes are ''neighbors'' in a wireless network. Neighbor discovery is an important enabler of network connectivity and energy conservation. An asynchronous, probabilistic neighbor discovery algorithm is p

Deployment of an Algorithm for Large-Sca

Deployment of an Algorithm for Large-Scale Topology Discovery

✍ Donnet, B.; Raoult, P.; Friedman, T.; Crovella, M. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 545 KB

Genetic Algorithms for Route Discovery

✍ Gelenbe, E.; Liu, P.; Laine, J. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 240 KB

An Efficient, Probabilistically Sound Al

An Efficient, Probabilistically Sound Algorithm for Segmentation and Word Discovery

✍ Michael R. Brent 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 283 KB

TopHat-Fusion: an algorithm for discover

TopHat-Fusion: an algorithm for discovery of novel fusion transcripts

✍ Daehwan Kim, Steven L Salzberg 📂 Article 📅 2011 🏛 BioMed Central 🌐 English ⚖ 271 KB