Sciweavers

4095 search results - page 117 / 819
» How to test a tree
Sort
View
ICML
2007
IEEE
14 years 11 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
INFOCOM
2007
IEEE
14 years 4 months ago
On the Performance of Multiple-Tree-Based Peer-to-Peer Live Streaming
— In this paper we propose and analyze a generalized multiple-tree-based overlay architecture for peer-to-peer live streaming that employs multipath transmission and forward erro...
György Dán, Viktória Fodor, Ili...
EUROCAST
2007
Springer
108views Hardware» more  EUROCAST 2007»
14 years 2 months ago
Pattern-Based Verification for Trees
Abstract. Pattern-based verification trying to abstract away the concrete number of repeated memory structures is one of the approaches that have recently been proposed for verific...
Milan Ceska, Pavel Erlebach, Tomás Vojnar
VLDB
2000
ACM
151views Database» more  VLDB 2000»
14 years 1 months ago
The TreeScape System: Reuse of Pre-Computed Aggregates over Irregular OLAP Hierarchies
We present the TreeScape system that, unlike any other system known to the authors, enables the reuse of pre-computed aggregate query results for irregular dimension hierarchies, ...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
LREC
2010
151views Education» more  LREC 2010»
13 years 11 months ago
Training Parsers on Partial Trees: A Cross-language Comparison
We present a study that compares data-driven dependency parsers obtained by means of annotation projection between language pairs of varying structural similarity. We show how the...
Kathrin Spreyer, Lilja Øvrelid, Jonas Kuhn