269 search results - page 50 / 54 » Complexity Theory Made Easy |
CSR
2010
Springer
14 years 1 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
GECCO
2010
Springer
14 years 1 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...
STOC
2010
ACM
14 years 20 days ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
STOC
2010
ACM
14 years 15 days ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...