2403 search results - page 63 / 481 » Optimal Randomized RANSAC |
134
click to vote
SPAA
2009
ACM
16 years 3 days ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
120
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
140
click to vote
CHES
2005
Springer
15 years 8 months ago
2005
Springer
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
119
click to vote
SOUPS
2009
ACM
15 years 9 months ago
2009
ACM
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...