5606 search results - page 357 / 1122 » Randomization Techniques for Graphs. |
165
click to vote
ESA
2005
Springer
16 years 5 days ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
187
Voted
KBSE
1997
IEEE
15 years 10 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
236
click to vote
TKDE
2012
13 years 9 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
156
click to vote
DLT
2006
15 years 8 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
171
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...