Sciweavers

724 search results - page 39 / 145
» Some Structural Complexity Aspects of Neural Computation
Sort
View
FOCS
2007
IEEE
14 years 3 months ago
Quantum Algorithms for Hidden Nonlinear Structures
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
Andrew M. Childs, Leonard J. Schulman, Umesh V. Va...
PPSN
1992
Springer
14 years 1 months ago
Nonstationary Function Optimization using the Structured Genetic Algorithm
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
Dipankar Dasgupta, Douglas R. McGregor
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
14 years 1 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
ICCV
2009
IEEE
13 years 6 months ago
Efficient human pose estimation via parsing a tree structure based human model
Human pose estimation is the task of determining the states (location, orientation and scale) of each body part. It is important for many vision understanding applications, e.g. v...
Xiaoqin Zhang, Changcheng Li, Xiaofeng Tong, Weimi...
FOSSACS
2007
Springer
14 years 3 months ago
On the Expressiveness and Complexity of ATL
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
François Laroussinie, Nicolas Markey, Ghass...