Jungles Preferred

Future information environments: deserts, jungles or parks?

Tarzan: Communicating and Moving in Wireless Jungles

Wireless networks allow portable/mobile devices (and the related applications) to communicate each other with radio or infrared signals. Computations on those networks are very sensible to many physical variables (e.g., energy consumption, distance, geographic topology, etc.). We propose Tarzan, a framework based on graph rewriting that easily allow one to express many quantitative aspects of w...

Jungles, bundles, and fixed parameter tractability

We give a fixed-parameter tractable (FPT) approximation algorithm computing the pathwidth of a tournament, and more generally, of a semi-complete digraph. Based on this result, we prove the following. • The Topological Containment problem is FPT on semi-complete digraphs. More precisely, given a semi-complete n-vertex digraph T and a digraph H, one can check in time f(|H|)n log n, where f is so...

How preferred are preferred terms?

We present a novel approach for synonymous term preference detection that relies on chronological text analysis. Our approach analyses the use of synonymous term entries in a chronological reference corpus. As a result of preference evaluation, a ranking of preference between all the synonymous term entries belonging to the same concept is established.

Trees, forests and jungles: a botanical garden for cluster expansions

Combinatoric formulas for cluster expansions have been improved many times over the years. Here we develop some new combinatoric proofs and extensions of the tree formulas of Brydges and Kennedy, and test them on a series of pedagogical examples.