Sciweavers

221 search results - page 11 / 45
» Random Convolution Ensembles
Sort
View
JC
2008
68views more  JC 2008»
13 years 9 months ago
On the number of minima of a random polynomial
We give an upper bound in O(d(n+1)/2 ) for the number of critical points of a normal random polynomial. The number of minima (resp. maxima) is in O(d(n+1)/2 )Pn, where Pn is the (...
Jean-Pierre Dedieu, Gregorio Malajovich
JAL
2002
113views more  JAL 2002»
13 years 9 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
PR
2007
129views more  PR 2007»
13 years 9 months ago
EROS: Ensemble rough subspaces
Ensemble learning is attracting much attention from pattern recognition and machine learning domains for good generalization. Both theoretical and experimental researches show tha...
Qinghua Hu, Daren Yu, Zongxia Xie, Xiaodong Li
ICA
2007
Springer
13 years 11 months ago
Gradient Convolution Kernel Compensation Applied to Surface Electromyograms
Abstract. This paper introduces gradient based method for robust assessment of the sparse pulse sources, such as motor unit innervation pulse trains in the filed of electromyograp...
Ales Holobar, Damjan Zazula
HICSS
2007
IEEE
103views Biometrics» more  HICSS 2007»
14 years 4 months ago
A Convolution Algorithm for Evaluating Supply Chain Delivery Performance
The effective management of a supply chain requires performance measures that accurately represent the underlying structure of the supply chain. Measures such as delivery performa...
Alfred L. Guiffrida, Robert A. Rzepka, Mohamad Y. ...