5606 search results - page 232 / 1122 » Randomization Techniques for Graphs. |
99
Voted
WSC
2008
15 years 3 months ago
2008
We propose a framework for optimization problems based on particle filtering (also called Sequential Monte Carlo method). This framework unifies and provides new insight into rand...
88
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
115
click to vote
ICALP
1992
Springer
15 years 4 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
114
click to vote
ENDM
2008
15 years 27 days ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
129
click to vote
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...