2403 search results - page 170 / 481 » Optimal Randomized RANSAC |
142
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
113
click to vote
TCC
2009
Springer
16 years 4 months ago
2009
Springer
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
153
Voted
EWSN
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
138
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
122
click to vote
AINA
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...