Sciweavers

830 search results - page 45 / 166
» Route kernels for trees
Sort
View
NETWORKS
2000
15 years 3 months ago
Minimizing number of wavelengths in multicast routing trees in WDM networks
Deying Li, Xiufeng Du, Xiao-Dong Hu, Lu Ruan, Xiao...
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 1 months ago
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
Fen Zhou, Miklós Molnár, Bernard Cou...
EURODAC
1995
IEEE
133views VHDL» more  EURODAC 1995»
15 years 7 months ago
Tree restructuring approach to mapping problem in cellular-architecture FPGAs
A new technique for mapping combinational circuits to Fine-Grain Cellular-Architecture FPGAs is presented. The proposed tree restructuring algorithm preserves local connectivity a...
Naveen Ramineni, Malgorzata Chrzanowska-Jeske, Nav...
114
Voted
ICML
2003
IEEE
16 years 4 months ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
ILP
2007
Springer
15 years 10 months ago
Learning with Kernels and Logical Representations
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
Paolo Frasconi