Sciweavers

822 search results - page 30 / 165
» Descendants in Increasing Trees
Sort
View
CN
2002
123views more  CN 2002»
13 years 7 months ago
IP multicast resource and topology discovery using a fan-out decrement mechanism
As the use of IP multicast sessions becomes widespread, the potential benefits derived from currently unavailable topological information on multicast distribution trees may becom...
Jangwon Lee, Gustavo de Veciana
IJAR
2010
189views more  IJAR 2010»
13 years 6 months ago
A fuzzy random forest
Following Breiman’s methodology, we propose a multi-classifier based on a “forest” of randomly generated fuzzy decision trees, i.e., a Fuzzy Random Forest. This approach co...
Piero P. Bonissone, José Manuel Cadenas, M....
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 3 days ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
MM
1996
ACM
128views Multimedia» more  MM 1996»
13 years 11 months ago
The Case for Reliable Concurrent Multicasting Using Shared Ack Trees
Such interactive, distributed multimedia applications as shared whiteboards, group editors, and simulations require reliable concurrent multicast services, i.e., the reliable diss...
Brian Neil Levine, David B. Lavo, J. J. Garcia-Lun...