Sciweavers

1717 search results - page 69 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
COCO
2007
Springer
84views Algorithms» more  COCO 2007»
16 years 10 days ago
Understanding Parallel Repetition Requires Understanding Foams
Motivated by the study of Parallel Repetition and also by the Unique Games Conjecture, we investigate the value of the “Odd Cycle Games” under parallel repetition. Using tools...
Uriel Feige, Guy Kindler, Ryan O'Donnell
3DIM
2001
IEEE
15 years 9 months ago
Comparison of HK and SC Curvature Description Methods
This paper compares two different local surface shape description methods. The general goal of surface shape description methods is to classify different surface shapes from range...
H. Cantzler, Robert B. Fisher
IGPL
2006
87views more  IGPL 2006»
15 years 6 months ago
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
Eli Shamir
ICASSP
2011
IEEE
14 years 10 months ago
An adaptive approach to abnormal heart sound segmentation
Heart sound is one of the significant bio-signals to diagnose certain cardiac anomalies. Aiming to provide an automatic heart sounds analysis to medical professionals, we present...
Dinesh Kumar, Paulo Carvalho, Manuel Antunes, Rui ...
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
16 years 22 days ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel