4403 search results - page 201 / 881 » Galois Theory of Algorithms |
180
click to vote
PERCOM
2004
ACM
16 years 6 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
154
click to vote
IJCAI
2007
15 years 8 months ago
2007
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 ...
142
click to vote
IWINAC
2007
Springer
16 years 20 days ago
2007
Springer
Theories of how the brain computes can be differentiated in three general conceptions: the algorithmic approach, the neural information processing (neurocomputational) approach an...
162
click to vote
FOCS
2006
IEEE
16 years 18 days ago
2006
IEEE
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
165
click to vote
ISAAC
2005
Springer
16 years 1 days ago
2005
Springer
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 ...