Sciweavers

4095 search results - page 60 / 819
» How to test a tree
Sort
View
SWAT
2000
Springer
114views Algorithms» more  SWAT 2000»
13 years 11 months ago
Maintaining Center and Median in Dynamic Trees
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...
Stephen Alstrup, Jacob Holm, Mikkel Thorup
ORL
2008
60views more  ORL 2008»
13 years 7 months ago
Lot-sizing on a tree
For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also sh...
Marco Di Summa, Laurence A. Wolsey
IANDC
2011
129views more  IANDC 2011»
13 years 2 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 8 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
ICDCS
1999
IEEE
14 years 3 days ago
On Providing Quality-of-Service Control for Core-Based Multicast Routing
In this paper, we develop e cient admission control tests for member join leave and its associated state refresh and update procedures for receiver-initiated core-based multicast ...
Hung-Ying Tyan, Chao-Ju Hou, Bin Wang 0002