Sciweavers

272 search results - page 17 / 55
» Lazy tree splitting
Sort
View
SOSP
2003
ACM
14 years 4 months ago
SplitStream: high-bandwidth multicast in cooperative environments
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highlyava...
Miguel Castro, Peter Druschel, Anne-Marie Kermarre...
EPIA
2005
Springer
14 years 1 months ago
Adapting Peepholing to Regression Trees
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
Luís Torgo, Joana Marques
ECML
2003
Springer
14 years 25 days ago
Improving the AUC of Probabilistic Estimation Trees
Abstract. In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that...
César Ferri, Peter A. Flach, José He...
WEBDB
2005
Springer
101views Database» more  WEBDB 2005»
14 years 1 months ago
T-SIX: An Indexing System for XML Siblings
We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling...
SungRan Cho
GLOBECOM
2010
IEEE
13 years 5 months ago
Approximation Ratios of Multicast Light-Trees in WDM Networks
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
Fen Zhou, Miklós Molnár, Bernard Cou...