14774 search results - page 457 / 2955 » Computational complexity and evolutionary computation |
186
click to vote
JASSS
2002
15 years 6 months ago
2002
In a paper published in JASSS, Chris Goldspink discusses the methodological implications of complex systems approaches to the modeling of social systems. Like others before him Go...
150
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
189
click to vote
BMVC
2010
15 years 4 months ago
2010
We describe a new multiscale keypoint detector and a set of local visual descriptors, both based on the efficient Dual-Tree Complex Wavelet Transform. The detector has properties ...
154
Voted
GI
2005
Springer
16 years 10 days ago
2005
Springer
: Rapid evolution of modern Information Systems and Process-Aware Information Systems (PAIS) in particular requires transactional execution of business logic. The paper introduces ...
181
click to vote
FOCS
2003
IEEE
16 years 3 days ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...