Sciweavers

16666 search results - page 350 / 3334
» Descriptive and Computational Complexity
Sort
View
ATAL
2007
Springer
16 years 29 days ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
NN
2006
Springer
234views Neural Networks» more  NN 2006»
15 years 6 months ago
Attention in natural scenes: Neurophysiological and computational bases
How does attention operate in natural scenes? We show that the receptive fields of inferior temporal cortex neurons that implement object representations become small and located ...
Edmund T. Rolls, Gustavo Deco
CDC
2009
IEEE
185views Control Systems» more  CDC 2009»
15 years 11 months ago
Discrete Empirical Interpolation for nonlinear model reduction
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
Saifon Chaturantabut, Danny C. Sorensen
CSB
2004
IEEE
112views Bioinformatics» more  CSB 2004»
15 years 10 months ago
Reasoning about Molecular Similarity and Properties
Ascertaining the similarity amongst molecules is a fundamental problem in biology and drug discovery. Since similar molecules tend to have similar biological properties, the notio...
Rahul Singh
NIPS
2000
15 years 8 months ago
Learning Continuous Distributions: Simulations With Field Theoretic Priors
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
Ilya Nemenman, William Bialek