We explore scalability issues of the text classification problem where using (multi)labeled training documents we try to build classifiers that assign documents into classes permitting classification in multiple classes. A new class of classification problems, called ‘scalable’ is introduced that models many problems from the area of Web mining. The property of scalability is defined as the abi...

We present a coalescent process where three particles merge at each coagulation step. Using a random walk representation, we prove duality with a fragmentation process, whose fragmentation law we specify explicitly. Furthermore, we give a second construction of the coalescent in terms of random binary forests and study asymptotic properties. Starting from N particles of unit mass, we obtain und...

This paper present a semantic and syntactic distance based method in topic text segmentation and compare it to a very well known text segmentation algorithm: c99. To do so we ran the two algorithms on a corpus of twenty two French political discourses and compared their results.

a r t i c l e i n f o a b s t r a c t Keywords: Algorithms Combinatorial problems Pattern avoiding permutation Whole duplication-random loss model Genome Generating algorithm Binary reflected Gray code In this paper we study the problem of the whole mirror duplication-random loss model in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this model af...

Out of dissatisfaction with currently available software, we built a music management program for large digital music libraries. We propose a system that solves some of the difficulties of organizing these libraries. The system introduces a new visual interaction style with the user’s music collection. A physics system coupled to album’s genre information allows the user to spatially order his ...