4164 search results - page 626 / 833 » Timing model reduction for hierarchical timing analysis |
293
click to vote
ICITS
2011
14 years 10 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
207
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
192
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
198
click to vote
WIMOB
2008
IEEE
16 years 29 days ago
2008
IEEE
— During an emergency response, access to a reliable communication infrastructure is required to exchange accurate information in a timely manner. Various communication technolog...
195
click to vote
ICNP
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract—In the paper, we devise and evaluate a fully decentralized, light-weight, dynamic clustering algorithm for target tracking. Instead of assuming the same role for all the...