Sciweavers

377 search results - page 62 / 76
» Linear Tabling Strategies and Optimizations
Sort
View
CCCG
2008
13 years 9 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
PR
2008
85views more  PR 2008»
13 years 7 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders
TPDS
2008
124views more  TPDS 2008»
13 years 7 months ago
Efficient Breadth-First Search on the Cell/BE Processor
Multicore processors are an architectural paradigm shift that promises a dramatic increase in performance. But, they also bring an unprecedented level of complexity in algorithmic ...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
GECCO
2004
Springer
14 years 26 days ago
A Step Size Preserving Directed Mutation Operator
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...
Stefan Berlik
SIAMNUM
2011
144views more  SIAMNUM 2011»
13 years 2 months ago
Continuous Mesh Framework Part II: Validations and Applications
This paper gives a numerical validation of the continuous mesh framework introduced in Part I [23]. We numerically show that the interpolation error can be evaluated analytically o...
Adrien Loseille, Frédéric Alauzet