Sciweavers

5699 search results - page 261 / 1140
» Alternating model trees
Sort
View
IPPS
2005
IEEE
16 years 26 days ago
A Distributed Procedure for Bandwidth-Centric Scheduling of Independent-Task Applications
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication time...
Cyril Banino
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
16 years 15 days ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
TON
2002
94views more  TON 2002»
15 years 6 months ago
Multicast routing and wavelength assignment in multihop optical networks
Abstract--This paper addresses multicast routing in circuitswitched multihop optical networks employing wavelength-division multiplexing. We consider a model in which multicast com...
Ran Libeskind-Hadas, Rami G. Melhem
EDBT
2011
ACM
205views Database» more  EDBT 2011»
14 years 10 months ago
A probabilistic XML merging tool
This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is...
Talel Abdessalem, M. Lamine Ba, Pierre Senellart
DASFAA
2005
IEEE
141views Database» more  DASFAA 2005»
16 years 27 days ago
Learning Tree Augmented Naive Bayes for Ranking
Naive Bayes has been widely used in data mining as a simple and effective classification algorithm. Since its conditional independence assumption is rarely true, numerous algorit...
Liangxiao Jiang, Harry Zhang, Zhihua Cai, Jiang Su