Sciweavers

580 search results - page 56 / 116
» Choosing a random peer
Sort
View
PAM
2004
Springer
15 years 5 months ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella
ICNP
2003
IEEE
15 years 5 months ago
Mobile Distributed Information Retrieval for Highly-Partitioned Networks
We propose and evaluate a mobile, peer-to-peer Information Retrieval system. Such a system can, for example, support medical care in a disaster by allowing access to a large colle...
Katrina M. Hanna, Brian Neil Levine, R. Manmatha
BROADNETS
2006
IEEE
15 years 3 months ago
On Traffic Grooming Choices for IP over WDM networks
Traffic grooming continues to be a rich area of research in the context of WDM optical networks. We provide an overview of the optical and electronic grooming techniques available...
Srivatsan Balasubramanian, Arun K. Somani
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 1 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
BIOINFORMATICS
2005
152views more  BIOINFORMATICS 2005»
14 years 11 months ago
Intervention in context-sensitive probabilistic Boolean networks
Motivation: Intervention in a gene regulatory network is used to help it avoid undesirable states, such as those associated with a disease. Several types of intervention have been...
Ranadip Pal, Aniruddha Datta, Michael L. Bittner, ...