10289 search results - page 401 / 2058 » Standard bases in K |
158
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
225
click to vote
STOC
2000
ACM
15 years 11 months ago
2000
ACM
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...
193
click to vote
EUROCOLT
1997
Springer
15 years 11 months ago
1997
Springer
Most of the work on the Vapnik-Chervonenkis dimension of neural networks has been focused on feedforward networks. However, recurrent networks are also widely used in learning app...
171
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
229
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: With the advances in DNA sequencer-based technologies, it has become possible to automate several steps of the genotyping process leading to increased throughput. To e...