Sciweavers

74 search results - page 14 / 15
» Enumerating randoms
Sort
View
IPPS
1997
IEEE
13 years 8 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
JCT
2010
83views more  JCT 2010»
13 years 3 months ago
Families of prudent self-avoiding walks
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...
Mireille Bousquet-Mélou
RECOMB
2004
Springer
14 years 5 months ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
WWW
2007
ACM
14 years 5 months ago
Preference-based selection of highly configurable web services
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...
BMCBI
2004
111views more  BMCBI 2004»
13 years 4 months ago
Aggregation of topological motifs in the Escherichia coli transcriptional regulatory network
Background: Transcriptional regulation of cellular functions is carried out through a complex network of interactions among transcription factors and the promoter regions of genes...
Radu Dobrin, Qasim K. Beg, Albert-Lászl&oac...