5606 search results - page 169 / 1122 » Randomization Techniques for Graphs. |
104
click to vote
NAACL
2007
15 years 5 months ago
2007
A novel random text generation model is introduced. Unlike in previous random text models, that mainly aim at producing a Zipfian distribution of word frequencies, our model also ...
118
Voted
ALGORITHMICA
2007
15 years 3 months ago
2007
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
165
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
99
Voted
ISCAS
2006
IEEE
15 years 9 months ago
2006
IEEE
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
256
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...