1923 search results - page 110 / 385 » Weighted Decision Trees |
132
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
Allometric scaling is an important universal property of metabolic living systems. It also describes the self-similar branching treeliked structures in transportation networks. Thi...
166
click to vote
FCT
2009
Springer
16 years 26 days ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
168
click to vote
JUCS
2010
15 years 4 months ago
2010
: Information Systems usually rely on external and independent data sources. When integrating the data to build the integrated repository it is possible to make use of the temporal...
151
click to vote
ALT
2010
Springer
15 years 7 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
161
click to vote
TOC
2010
15 years 1 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...