Sciweavers

1147 search results - page 27 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Error bounds for correlation clustering
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
Thorsten Joachims, John E. Hopcroft
TCAD
2008
98views more  TCAD 2008»
13 years 7 months ago
Early Analysis and Budgeting of Margins and Corners Using Two-Sided Analytical Yield Models
Manufacturing process variations lead to variability in circuit delay and, if not accounted for, can cause excessive timing yield loss. The familiar traditional approaches to timin...
Khaled R. Heloue, Farid N. Najm
GLVLSI
2010
IEEE
190views VLSI» more  GLVLSI 2010»
13 years 9 months ago
A linear statistical analysis for full-chip leakage power with spatial correlation
In this paper, we present an approved linear-time algorithm for statistical leakage analysis in the present of any spatial correlation condition (strong or weak). The new algorith...
Ruijing Shen, Sheldon X.-D. Tan, Jinjun Xiong
CCS
1998
ACM
13 years 12 months ago
A Probabilistic Poly-Time Framework for Protocol Analysis
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
Patrick Lincoln, John C. Mitchell, Mark Mitchell, ...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer