Sciweavers

613 search results - page 56 / 123
» Time Optimal Self-Stabilizing Spanning Tree Algorithms
Sort
View
DAC
2004
ACM
15 years 1 months ago
Quadratic placement using an improved timing model
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
Bernd Obermeier, Frank M. Johannes
ACTA
2000
302views more  ACTA 2000»
14 years 9 months ago
Efficiently building a parse tree from a regular expression
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
Danny Dubé, Marc Feeley
COLT
2010
Springer
14 years 7 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
ISVLSI
2003
IEEE
97views VLSI» more  ISVLSI 2003»
15 years 3 months ago
Q-Tree: A New Iterative Improvement Approach for Buffered Interconnect Optimization
The “chicken-egg” dilemma between VLSI interconnect timing optimization and delay calculation suggests an iterative approach. We separate interconnect timing transformation as...
Andrew B. Kahng, Bao Liu
SSS
2009
Springer
107views Control Systems» more  SSS 2009»
15 years 4 months ago
A Self-stabilizing Algorithm for Graph Searching in Trees
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
Rodica Mihai, Morten Mjelde