Sciweavers

3049 search results - page 255 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ECCV
2002
Springer
16 years 8 months ago
Structure from Planar Motions with Small Baselines
We study the multi-frame structure from motion problem when the camera translates on a plane with small baselines and arbitrary rotations. This case shows up in many practical appl...
John Oliensis, René Vidal
JMLR
2008
92views more  JMLR 2008»
15 years 6 months ago
Theoretical Advantages of Lenient Learners: An Evolutionary Game Theoretic Perspective
This paper presents the dynamics of multiple learning agents from an evolutionary game theoretic perspective. We provide replicator dynamics models for cooperative coevolutionary ...
Liviu Panait, Karl Tuyls, Sean Luke
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 6 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 6 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
ECCC
2006
134views more  ECCC 2006»
15 years 6 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao