Sciweavers

14403 search results - page 145 / 2881
» Dynamical Systems Trees
Sort
View
ISPD
2006
ACM
108views Hardware» more  ISPD 2006»
15 years 10 months ago
Statistical clock tree routing for robustness to process variations
Advances in VLSI technology make clock skew more susceptible to process variations. Notwithstanding efficient zero skew routing algorithms, clock skew still limits post-manufactu...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
ICTAI
2003
IEEE
15 years 9 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
15 years 4 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
TCAD
2008
100views more  TCAD 2008»
15 years 4 months ago
Robust Clock Tree Routing in the Presence of Process Variations
Abstract--Advances in very large-scale integration technology make clock skew more susceptible to process variations. Notwithstanding efficient exact zero-skew algorithms, clock sk...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
NETWORKING
2011
14 years 7 months ago
Modelling and Evaluation of CCN-Caching Trees
Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Intern...
Ioannis Psaras, Richard G. Clegg, Raul Landa, Wei ...