Sciweavers

683 search results - page 47 / 137
» A Fine-grained Analysis of a Simple Independent Set Algorith...
Sort
View
116
Voted
IJCNN
2007
IEEE
15 years 10 months ago
FEBAM: A Feature-Extracting Bidirectional Associative Memory
—In this paper, a new model that can ultimately create its own set of perceptual features is proposed. Using a bidirectional associative memory (BAM)-inspired architecture, the r...
Sylvain Chartier, Gyslain Giguère, Patrice ...
137
Voted
ICPR
2006
IEEE
16 years 4 months ago
Part-Based Probabilistic Point Matching
Correspondence algorithms typically struggle with shapes that display part-based variation. We present a probabilistic approach that matches shapes using independent part transfor...
Graham McNeill, Sethu Vijayakumar
173
Voted
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 10 months 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
157
Voted
ATAL
2009
Springer
15 years 10 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
157
Voted
FOCS
2007
IEEE
15 years 10 months ago
Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
Sudipto Guha, Kamesh Munagala