Sciweavers

1891 search results - page 282 / 379
» Constrained Subspace Modelling
Sort
View
COGSCI
2010
88views more  COGSCI 2010»
13 years 10 months ago
Domain-Creating Constraints
The contributions to this special issue on cognitive development collectively propose ways in which learning involves developing constraints that shape subsequent learning. A lear...
Robert L. Goldstone, David Landy
COGSCI
2010
234views more  COGSCI 2010»
13 years 10 months ago
High Regularities in Eye-Movement Patterns Reveal the Dynamics of the Visual Working Memory Allocation Mechanism
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...
Xiaohui Kong, Christian D. Schunn, Garrick L. Wall...
AI
2006
Springer
13 years 10 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
AUTOMATICA
2006
113views more  AUTOMATICA 2006»
13 years 10 months ago
Least costly identification experiment for control
All approaches to optimal experiment design for control have so far focused on deriving an input signal (or input signal spectrum) that minimizes some control-oriented measure of ...
Xavier Bombois, Gérard Scorletti, Michel Ge...
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 10 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright