—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, re...
Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel ...
— This paper presents inverse position kinematics algorithms with real time capability for Justin, a robotic system with high redundancy and many degrees of freedom. The combinat...
A novel method for integrating multiple range images in a multi-view stereo imaging system is presented here. Due to self-occlusion an individual range image provides only a parti...
J. Paul Siebert, Jiahua Wu, Nigel J. B. McFarlane,...
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...