Sciweavers

925 search results - page 68 / 185
» A Solution to the Extended GCD Problem
Sort
View
PE
2010
Springer
102views Optimization» more  PE 2010»
13 years 7 months ago
Extracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
Douglas V. de Jager, Jeremy T. Bradley
ISAAC
2004
Springer
107views Algorithms» more  ISAAC 2004»
14 years 2 months ago
On the Hardness and Easiness of Random 4-SAT Formulas
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
Andreas Goerdt, André Lanka
JMLR
2008
92views more  JMLR 2008»
13 years 9 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
PAMI
2008
162views more  PAMI 2008»
13 years 9 months ago
Bayes Optimality in Linear Discriminant Analysis
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
Onur C. Hamsici, Aleix M. Martínez
ICIP
2006
IEEE
14 years 10 months ago
Robust Kernel-Based Tracking using Optimal Control
Although more efficient in computation compared to other tracking approaches such as particle filtering, the kernel-based tracking suffers from the "singularity" problem...
Wei Qu, Dan Schonfeld