Sciweavers

1257 search results - page 17 / 252
» A generalization of Euler's constant
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
ICDAR
2009
IEEE
14 years 2 months ago
Constant-Time Locally Optimal Adaptive Binarization
Scanned document images are nowadays becoming available in increasingly higher resolutions. Meanwhile, the variations in image quality within typical document collections increase...
Iuliu Konya Konya, Christoph Seibert, Stefan Eicke...
ICCV
2011
IEEE
12 years 7 months ago
Double Window Optimisation for Constant Time Visual SLAM
We present a novel and general optimisation framework for visual SLAM, which scales for both local, highly accurate reconstruction and large-scale motion with long loop closures. ...
Hauke Strasdat, Andrew J. Davison, J. M. M. Montie...
MCSS
2007
Springer
13 years 7 months ago
Lyapunov functions for time-varying systems satisfying generalized conditions of Matrosov theorem
The classical Matrosov theorem concludes uniform asymptotic stability of time varying systems via a weak Lyapunov function (positive definite, decrescent, with negative semidefi...
Frédéric Mazenc, Dragan Nesic
GECCO
2008
Springer
175views Optimization» more  GECCO 2008»
13 years 8 months ago
Using differential evolution for symbolic regression and numerical constant creation
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
Brian M. Cerny, Peter C. Nelson, Chi Zhou