In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
Time is one of the most difficult aspects to handle in real world applications such as database systems. Relational database management systems proposed by Codd offer very little ...
We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into K clusters and represents each cluster by a simple pr...
Knowing or being able to measure the "path density" at sources of communications is essential to provide fair capacity distribution between sessions in multi-hop ad hoc ...