446 search results - page 68 / 90 » A Combinatorial Theorem for Trees |
161
click to vote
ALT
2002
Springer
16 years 2 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
140
click to vote
ISSAC
2009
Springer
16 years 12 days ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
157
click to vote
IWPEC
2009
Springer
16 years 12 days ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
158
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
145
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we study multiple target detection using Bayesian learning. The main aim of the paper is to present a computationally efficient way to compute the belief map update ...