1511 search results - page 2 / 303 » Randomness, lowness and degrees |
SODA
2004
ACM
14 years 7 days ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
MM
2005
ACM
14 years 4 months ago
2005
ACM
alization is a combination of abstract generated forms and found imagery. The frequency, amplitude, and percentage differences between samples of incoming data are mapped to forms ...
FCS
2009
13 years 8 months ago
2009
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...