Sciweavers

841 search results - page 32 / 169
» Cell packing structures
Sort
View
DAC
2010
ACM
15 years 10 days ago
Detecting tangled logic structures in VLSI netlists
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
Tanuj Jindal, Charles J. Alpert, Jiang Hu, Zhuo Li...
ACISP
2009
Springer
15 years 5 months ago
Cryptographic Properties and Application of a Generalized Unbalanced Feistel Network Structure
Abstract. In this paper, we study GF-NLFSR, a Generalized Unbalanced Feistel Network (GUFN) which can be considered as an extension of the outer function FO of the KASUMI block cip...
Jiali Choy, Guanhan Chew, Khoongming Khoo, Huihui ...
ISBI
2008
IEEE
15 years 12 months ago
Tracking displacements of intracellular organelles in response to nanomechanical forces
The living cell is under constant influence of mechanical forces from its environment. These forces affect many aspects of the cell's behaviour, including morphology, growth,...
Yaron R. Silberberg, Andrew E. Pelling, Gleb E. Ya...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
15 years 11 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 2 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....