Sciweavers

39 search results - page 6 / 8
» Sampling Combinatorial Spaces Using Biased Random Walks
Sort
View
ECCV
2002
Springer
14 years 7 months ago
Hyperdynamics Importance Sampling
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
Cristian Sminchisescu, Bill Triggs
BIOINFORMATICS
2010
94views more  BIOINFORMATICS 2010»
13 years 5 months ago
Globally, unrelated protein sequences appear random
Motivation: To test whether protein folding constraints and secondary structure sequence preferences significantly reduce the space of amino acid words in proteins, we compared th...
Daniel T. Lavelle, William R. Pearson
ICASSP
2010
IEEE
13 years 5 months ago
Robust regression using sparse learning for high dimensional parameter estimation problems
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
13 years 10 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
WWW
2011
ACM
13 years 8 days ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg