Sciweavers

2517 search results - page 103 / 504
» Specifying Weak Sets
Sort
View
CADE
2009
Springer
16 years 6 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
CVPR
2006
IEEE
16 years 7 months ago
Applying Ensembles of Multilinear Classifiers in the Frequency Domain
Ensemble methods such as bootstrap, bagging or boosting have had a considerable impact on recent developments in machine learning, pattern recognition and computer vision. Theoret...
Christian Bauckhage, Thomas Käster, John K. T...
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 9 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
JIB
2006
220views more  JIB 2006»
15 years 5 months ago
An assessment of machine and statistical learning approaches to inferring networks of protein-protein interactions
Protein-protein interactions (PPI) play a key role in many biological systems. Over the past few years, an explosion in availability of functional biological data obtained from hi...
Fiona Browne, Haiying Wang, Huiru Zheng, Francisco...
CVPR
2005
IEEE
16 years 7 months ago
Random Subspaces and Subsampling for 2-D Face Recognition
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...
Nitesh V. Chawla, Kevin W. Bowyer