Sciweavers

1538 search results - page 71 / 308
» Relative Randomness and Cardinality
Sort
View
TSE
2011
144views more  TSE 2011»
14 years 4 months ago
Genetic Algorithms for Randomized Unit Testing
—Randomized testing is an effective method for testing software units. Thoroughness of randomized unit testing varies widely according to the settings of certain parameters, such...
James H. Andrews, Tim Menzies, Felix Chun Hang Li
EMNLP
2011
13 years 9 months ago
Random Walk Inference and Learning in A Large Scale Knowledge Base
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
Ni Lao, Tom M. Mitchell, William W. Cohen
CVPR
2006
IEEE
15 years 11 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
ECCV
2008
Springer
15 years 11 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
KDD
2004
ACM
195views Data Mining» more  KDD 2004»
15 years 10 months ago
Improved robustness of signature-based near-replica detection via lexicon randomization
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
Aleksander Kolcz, Abdur Chowdhury, Joshua Alspecto...