Sciweavers

4372 search results - page 199 / 875
» Algorithmic Theories of Everything
Sort
View
102
Voted
IJCAI
2007
15 years 2 months ago
Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree
In the past ten years, boosting has become a major field of machine learning and classification. This paper brings contributions to its theory and algorithms. We first unify a ...
Claudia Henry, Richard Nock, Frank Nielsen
88
Voted
IWINAC
2007
Springer
15 years 7 months ago
Brain Organization and Computation
Theories of how the brain computes can be differentiated in three general conceptions: the algorithmic approach, the neural information processing (neurocomputational) approach an...
Andreas Schierwagen
99
Voted
FOCS
2006
IEEE
15 years 6 months ago
Cryptographic Hardness for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
Adam R. Klivans, Alexander A. Sherstov
106
Voted
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
15 years 6 months ago
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
Kenya Ueno
SCAM
2003
IEEE
15 years 6 months ago
Slicing the SCAM Mug: A Case Study in Semantic Slicing
In this paper we describe an improved formalisation of slicing in WSL transformation theory and apply the result to a particularly challenging slicing problem: the SCAM mug [1]. W...
Martin P. Ward