Sciweavers

526 search results - page 6 / 106
» On the Number of Minimal Addition Chains
Sort
View
RECOMB
2005
Springer
15 years 10 months ago
Rapid Protein Side-Chain Packing via Tree Decomposition
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
Jinbo Xu
ICCAD
2003
IEEE
127views Hardware» more  ICCAD 2003»
15 years 6 months ago
Layout-Aware Scan Chain Synthesis for Improved Path Delay Fault Coverage
Path delay fault testing becomes increasingly important due to higher clock rates and higher process variability caused by shrinking geometries. Achieving high-coverage path delay...
Puneet Gupta, Andrew B. Kahng, Ion I. Mandoiu, Pun...
AINA
2009
IEEE
15 years 4 months ago
An Energy Efficient Chain-Based Clustering Routing Protocol for Wireless Sensor Networks
— Wireless sensor network consisting of a large number of sensors is effective for gathering data in a variety of environments. Since the sensors operate on battery of limited po...
Jae Duck Yu, Kyung Tae Kim, Bo Yle Jung, Hee Yong ...
IROS
2008
IEEE
172views Robotics» more  IROS 2008»
15 years 4 months ago
Hand-eye self-calibration of an ultrasound image-based robotic system
— In recent years, there has been an increasing interest in developing systems that couple a robotic device with an ultrasound imager. Applications range from automatic probe pos...
Marie-Aude Vitrani, Guillaume Morel
FSTTCS
2005
Springer
15 years 3 months ago
Comparing Trees Via Crossing Minimization
Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges...
Henning Fernau, Michael Kaufmann, Mathias Poths