Sciweavers

1370 search results - page 259 / 274
» On grids in topological graphs
Sort
View
BIBE
2006
IEEE
154views Bioinformatics» more  BIBE 2006»
14 years 2 months ago
Determining Molecular Similarity for Drug Discovery using the Wavelet Riemannian Metric
Discerning the similarity between two molecules is a challenging problem in drug discovery as well as in molecular biology. The importance of this problem is due to the fact that ...
Elinor Velasquez, Emmanuel R. Yera, Rahul Singh
IWCMC
2006
ACM
14 years 2 months 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
PODC
2005
ACM
14 years 2 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
14 years 1 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
FSTTCS
2004
Springer
14 years 1 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi