1631 search results - page 155 / 327 » Uniform Distributed Synthesis |
161
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
177
click to vote
GLOBECOM
2007
IEEE
16 years 21 days ago
2007
IEEE
— We study the problem of reliably provisioning traffic in high-capacity backbone mesh networks supporting virtual concatenation (VCAT). VCAT enables a connection to be inversel...
149
click to vote
PG
2007
IEEE
16 years 19 days ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
142
click to vote
ISSTA
2006
ACM
16 years 10 days ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
172
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would bene...