Sciweavers

830 search results - page 10 / 166
» Route kernels for trees
Sort
View
95
Voted
GLVLSI
2003
IEEE
177views VLSI» more  GLVLSI 2003»
15 years 5 months ago
Congestion reduction in traditional and new routing architectures
In dense integrated circuit designs, management of routing congestion is essential; an over congested design may be unroutable. Many factors influence congestion: placement, rout...
Ameya R. Agnihotri, Patrick H. Madden
90
Voted
NIPS
2003
15 years 1 months ago
Kernels for Structured Natural Language Data
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
Jun Suzuki, Yutaka Sasaki, Eisaku Maeda
WG
2004
Springer
15 years 5 months ago
Collective Tree Spanners and Routing in AT-free Related Graphs
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
ADHOC
2007
173views more  ADHOC 2007»
14 years 11 months ago
QoS multicast routing by using multiple paths/trees in wireless ad hoc networks
In this paper, we investigate the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of a wireless node, a QoS multicast call could often be blo...
Huayi Wu, Xiaohua Jia
CIDM
2007
IEEE
15 years 3 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...