Sciweavers

16430 search results - page 80 / 3286
» On Computable Tree Functions
Sort
View
DATE
2002
IEEE
104views Hardware» more  DATE 2002»
15 years 8 months ago
Closed-Form Crosstalk Noise Metrics for Physical Design Applications
In this paper we present efficient closed-form formulas to estimate capacitive coupling-induced crosstalk noise for distributed RC coupling trees. The efficiency of our approach...
Lauren Hui Chen, Malgorzata Marek-Sadowska
CONPAR
1992
15 years 7 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
ACL
1993
15 years 4 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka
WG
2005
Springer
15 years 8 months ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...
ACL
2008
15 years 4 months ago
Computing Confidence Scores for All Sub Parse Trees
Computing confidence scores for applications, such as dialogue system, information retrieving and extraction, is an active research area. However, its focus has been primarily on ...
Feng Lin, Fuliang Weng