Sciweavers

564 search results - page 56 / 113
» Error-tolerant Tree Matching
Sort
View
DAC
1995
ACM
15 years 3 months ago
On the Bounded-Skew Clock and Steiner Routing Problems
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...
Dennis J.-H. Huang, Andrew B. Kahng, Chung-Wen Alb...
ICCAD
1995
IEEE
129views Hardware» more  ICCAD 1995»
15 years 3 months ago
Activity-driven clock design for low power circuits
In this paper we investigate activity-driven clock trees to reduce the dynamic power consumption of synchronous digital CMOS circuits. Sections of an activity-driven clock tree ca...
Gustavo E. Téllez, Amir H. Farrahi, Majid S...
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 1 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
14 years 10 months ago
Large-Scale Support Vector Learning with Structural Kernels
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
Aliaksei Severyn, Alessandro Moschitti
ROBOCUP
2005
Springer
115views Robotics» more  ROBOCUP 2005»
15 years 5 months ago
3D Mapping with Semantic Knowledge
Abstract. A basic task of rescue robot systems is mapping of the environment. Localizing injured persons, guiding rescue workers and excavation equipment requires a precise 3D map ...
Andreas Nüchter, Oliver Wulf, Kai Lingemann, ...