5592 search results - page 422 / 1119 » On Random Betweenness Constraints |
183
click to vote
PDCAT
2005
Springer
16 years 7 days ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
165
Voted
APPROX
2004
Springer
16 years 5 days ago
2004
Springer
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
180
click to vote
NOSSDAV
2004
Springer
16 years 3 days ago
2004
Springer
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
203
click to vote
SAC
2003
ACM
16 years 16 hour ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
209
click to vote
HT
2010
ACM
15 years 8 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...