5606 search results - page 291 / 1122 » Randomization Techniques for Graphs. |
207
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
152
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
184
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
158
click to vote
CVIU
2007
15 years 6 months ago
2007
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
165
click to vote
ISSTA
2006
ACM
16 years 15 days ago
2006
ACM
There are several problem areas that must be addressed when applying randomization to unit testing. As yet no general, fully automated solution that works for all units has been p...