Sciweavers

2996 search results - page 120 / 600
» Numberings and Randomness
Sort
View
ECCV
2008
Springer
16 years 7 months ago
A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus
The Random Sample Consensus (RANSAC) algorithm is a popular tool for robust estimation problems in computer vision, primarily due to its ability to tolerate a tremendous fraction o...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 5 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
PERCOM
2009
ACM
16 years 5 days ago
Randomizing RFID Private Authentication
—Privacy protection is increasingly important during authentications in Radio Frequency Identification (RFID) systems. In order to achieve high-speed authentication in largescale...
Qingsong Yao, Yong Qi, Jinsong Han, Jizhong Zhao, ...
SECON
2007
IEEE
15 years 11 months ago
Two-hop Relaying in Random Networks with Limited Channel State Information
— In this paper we study two-hop cooperative diversity relaying in random wireless networks. In contrast to most work on cooperative diversity relaying where the relay node posit...
Furuzan Atay Onat, Dan Avidor, Sayandev Mukherjee
134
Voted
ACSAC
2006
IEEE
15 years 11 months ago
Known/Chosen Key Attacks against Software Instruction Set Randomization
Instruction Set Randomization (ISR) has been proposed as a form of defense against binary code injection into an executing program. One proof-of-concept implementation is Randomiz...
Yoav Weiss, Elena Gabriela Barrantes