5606 search results - page 876 / 1122 » Randomization Techniques for Graphs. |
193
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
207
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...
182
click to vote
Publication
Traceback schemes aim at identifying the source(s) of a sequence of packets and the nodes these packets traversed. This is useful for tracing the sources of high volume traffic, e...
183
click to vote
CORR
2008
Springer
2008
Springer
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
15 years 6 months ago
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
194
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...