Sciweavers

10602 search results - page 60 / 2121
» Weakly Useful Sequences
Sort
View
IGPL
2010
158views more  IGPL 2010»
13 years 7 months ago
Ontology-revision operators based on reinterpretation
Communication between natural or artificial agents relies on the use of a common vocabulary. Since sharing terms does not necessarily imply that the terms have exactly the same m...
Carola Eschenbach, Özgür L. Öz&cced...
RSA
1998
82views more  RSA 1998»
13 years 8 months ago
Convergence of branching processes to the local time of a Bessel process
We study Galton-Watson branching processes conditioned on the total progeny to be n which are scaled by a sequence cn tending to infinity as o( √ n). It is shown that this proce...
Bernhard Gittenberger
PRL
2007
138views more  PRL 2007»
13 years 8 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh
PPPJ
2003
ACM
14 years 2 months ago
Towards the systematic use of interfaces in JAVA programming
JAVA’s interface construct is widely perceived as a weak surrogate for multiple inheritance. Consequently, it should come as no surprise that despite their potential for writing...
Friedrich Steimann, Wolf Siberski, Thomas Küh...
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 11 months ago
Black-box optimization benchmarking for noiseless function testbed using artificial bee colony algorithm
This paper benchmarks the Artificial Bee Colony (ABC) algorithm using the noise-free BBOB 2010 testbed. The results show how this algorithm is highly successful in the separable a...
Mohammed El-Abd