Sciweavers

830 search results - page 11 / 166
» Route kernels for trees
Sort
View
LCN
2002
IEEE
15 years 4 months ago
Scalable Multicast Routing Protocol Using Anycast and Hierarchical-Trees
A novel efficiency and effectiveness Internet multicast routing protocol is presented with short delay, high throughput, resource utilization and scalability for a single multicas...
Weijia Jia, Pui-on Au, Gaochao Xu, Wei Zhao
PAKDD
2007
ACM
110views Data Mining» more  PAKDD 2007»
15 years 5 months ago
Combining Convolution Kernels Defined on Heterogeneous Sub-structures
Convolution kernels, constructed by convolution of sub-kernels defined on sub-structures of composite objects, are widely used in classification, where one important issue is to ch...
Minlie Huang, Xiaoyan Zhu
ICIP
2006
IEEE
15 years 5 months ago
Multiple Tree Video Multicast Over Wireless Ad Hoc Networks
—In this paper, we propose multiple tree construction schemes and routing protocols for video streaming over wireless ad hoc networks. The basic idea is to split the video into m...
Avideh Zakhor, Wei Wei
95
Voted
ICPPW
2003
IEEE
15 years 5 months ago
A Fault-tolerant Routing Strategy for Gaussian Cube Using Gaussian Tree
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...
Loh Peter, Xinhua Zhang
CORR
2010
Springer
174views Education» more  CORR 2010»
14 years 11 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor