530 search results - page 41 / 106 » Universal randomized switching |
140
click to vote
RSA
2008
15 years 3 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
153
click to vote
IFM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
162
Voted
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
162
click to vote
PAMI
2008
15 years 3 months ago
2008
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
132
Voted
TSP
2008
15 years 3 months ago
2008
A cross-layered slotted ALOHA protocol is proposed and analyzed for distributed estimation in sensor networks. Suppose that the sensors in the network record local measurements of ...