Sciweavers

16430 search results - page 205 / 3286
» On Computable Tree Functions
Sort
View
130
Voted
FUN
2007
Springer
91views Algorithms» more  FUN 2007»
15 years 10 months ago
High Spies (or How to Win a Programming Contest)
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
André H. Deutz, Rudy van Vliet, Hendrik Jan...
COMCOM
2006
120views more  COMCOM 2006»
15 years 4 months ago
Explicit routing in multicast overlay networks
Application Level Multicast is a promising approach to overcome the deployment problems of IP level multicast by establishing delivery trees using overlay links among end systems....
Torsten Braun, Vijay Arya, Thierry Turletti

Book
688views
17 years 2 months ago
Database Management Systems
A set of presentations covering the book, which includes the following topics ER Model and Conceptual Design, The Relational Model and SQL DDL, Relational Algebra, SQL, Database Ap...
Raghu Ramakrishnan, Johannes Gehrke
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
VLSID
2007
IEEE
160views VLSI» more  VLSID 2007»
16 years 4 months ago
Spectral RTL Test Generation for Microprocessors
We introduce a novel method of test generation for microprocessors at the RTL using spectral methods. Test vectors are generated for RTL faults, which are the stuck-at faults on i...
Nitin Yogi, Vishwani D. Agrawal