Sciweavers

7106 search results - page 424 / 1422
» Restricted Complexity, General Complexity
Sort
View
COGSCI
2010
234views more  COGSCI 2010»
15 years 7 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...
154
Voted
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 7 months ago
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
Robert Hildebrand, Matthias Köppe
CORR
2008
Springer
61views Education» more  CORR 2008»
15 years 7 months ago
Science mapping with asymmetrical paradigmatic proximity
We propose a series of methods to represent the evolution of a field of science at different levels: namely micro, meso and macro levels. We use a previously introduced asymmetric...
Jean-Philippe Cointet, David Chavalarias
IANDC
2006
102views more  IANDC 2006»
15 years 7 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
INFORMATICALT
2006
100views more  INFORMATICALT 2006»
15 years 7 months ago
Optimal Agreement in a Scale-Free Network Environment
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
Shu-Ching Wang, Kuo-Qin Yan, Mao-Lun Chiang