2996 search results - page 380 / 600 » Numberings and Randomness |
172
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
218
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
173
click to vote
DEBS
2007
ACM
15 years 10 months ago
2007
ACM
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
179
click to vote
CIBCB
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract-- The DNA microarray technology, originally developed to measure the level of gene expression, had become one of the most widely used tools in genomic study. Microarrays h...
209
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...