Sciweavers

147 search results - page 15 / 30
» Optimizing Probabilities of Real-Time Test Case Execution
Sort
View
ASIACRYPT
2010
Springer
13 years 6 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
PAMI
2008
146views more  PAMI 2008»
13 years 9 months ago
Optimal Randomized RANSAC
A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-specified probability. The solution i...
Ondrej Chum, Jiri Matas
HVC
2005
Springer
113views Hardware» more  HVC 2005»
14 years 2 months ago
Choosing Among Alternative Futures
Non-determinism is a serious impediment to testing and debugging concurrent programs. Such programs do not execute the same way each time they are run, which can hide the presence ...
Steve MacDonald, Jun Chen, Diego Novillo
JMM2
2007
118views more  JMM2 2007»
13 years 8 months ago
FPGA-based Real-time Optical Flow Algorithm Design and Implementation
—Optical flow algorithms are difficult to apply to robotic vision applications in practice because of their extremely high computational and frame rate requirements. In most case...
Zhaoyi Wei, Dah-Jye Lee, Brent E. Nelson
GECCO
2006
Springer
129views Optimization» more  GECCO 2006»
14 years 19 days ago
Use of statistical outlier detection method in adaptive evolutionary algorithms
In this paper, the issue of adapting probabilities for Evolutionary Algorithm (EA) search operators is revisited. A framework is devised for distinguishing between measurements of...
James M. Whitacre, Q. Tuan Pham, Ruhul A. Sarker