830 search results - page 46 / 166 » Route kernels for trees |
135
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
141
click to vote
DAC
1995
ACM
15 years 7 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
128
click to vote
GLVLSI
2003
IEEE
15 years 9 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
125
Voted
ESANN
2007
15 years 5 months ago
2007
The suitability of the well known kernels for trees, and the lesser known SelfOrganizing Map for Structures for categorization tasks on structured data is investigated in this pap...
131
click to vote
NIPS
2001
15 years 5 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...