Sciweavers

1060 search results - page 65 / 212
» On the Discovery of Random Trees
Sort
View
BIOINFORMATICS
2010
94views more  BIOINFORMATICS 2010»
14 years 10 months ago
Globally, unrelated protein sequences appear random
Motivation: To test whether protein folding constraints and secondary structure sequence preferences significantly reduce the space of amino acid words in proteins, we compared th...
Daniel T. Lavelle, William R. Pearson
84
Voted
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 4 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
ICDCS
2007
IEEE
15 years 4 months ago
AVMON: Optimal and Scalable Discovery of Consistent Availability Monitoring Overlays for Distributed Systems
This paper addresses the problem of selection and discovery of a consistent availability monitoring overlay for computer hosts in a large-scale distributed application, where host...
Ramsés Morales, Indranil Gupta
MONET
2006
141views more  MONET 2006»
14 years 10 months ago
An Energy-Optimal Algorithm for Neighbor Discovery in Wireless Sensor Networks
We consider sensor networks in which individual nodes with on-board sensing and low-power transmitters and receivers establish connections with neighboring nodes. The overall objec...
Ritesh Madan, Sanjay Lall
111
Voted
IJNSEC
2007
204views more  IJNSEC 2007»
14 years 10 months ago
Enhanced DSR for MANET with Improved Secured Route Discovery and QoS
Mobile Ad hoc NETwork (MANET) comprises of nodes, which are free to move randomly, yet cooperate to forward packets between source and destination over a multi-hop wireless networ...
Anil Rawat, Prakash Dattatraya Vyavahare, Ashwani ...