Abstract. Despite their crucial impact on the performances of p2p systems, very few is known on peers behaviors in such networks. We propose here a study of these behaviors in a ru...
In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte (2003) [15]. It says that a symmetric real polynomial F of degree d in n variabl...
Symbolic computation of NURBS plays an important role in many areas of NURBS-based geometric computation and design. However, any nontrivial symbolic computation, especially when ...
Xianming Chen, Richard F. Riesenfeld, Elaine Cohen
—In this work, we prove that a positive secure degree of freedom is achievable for a large class of real Gaussian channels as long as the channel is not degraded and the channel ...
Understanding and maintaining the structure of large ontologies is a cognitively demanding task. Visualizations are commonly used as a cognitive aid for presenting large ontologie...