Sciweavers

8298 search results - page 1313 / 1660
» On the Complexity of Numerical Analysis
Sort
View
CIVR
2009
Springer
174views Image Analysis» more  CIVR 2009»
16 years 1 months ago
Evaluation of GIST descriptors for web-scale image search
The GIST descriptor has recently received increasing attention in the context of scene recognition. In this paper we evaluate the search accuracy and complexity of the global GIST...
Matthijs Douze, Herve Jegou, Harsimrat Sandhawalia...
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
Short and Stateless Signatures from the RSA Assumption
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
Susan Hohenberger, Brent Waters
EUROGP
2009
Springer
132views Optimization» more  EUROGP 2009»
16 years 1 months ago
A Statistical Learning Perspective of Genetic Programming
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
Nur Merve Amil, Nicolas Bredeche, Christian Gagn&e...
GECCO
2009
Springer
16 years 1 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
16 years 1 months ago
Insight knowledge in search based software testing
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
Andrea Arcuri
« Prev « First page 1313 / 1660 Last » Next »