The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
—This paper presents the first hierarchical Byzantine fault-tolerant replication architecture suitable to systems that span multiple wide area sites. The architecture confines ...
Yair Amir, Claudiu Danilov, Danny Dolev, Jonathan ...
A feature-oriented generic progressive lossless mesh coder (FOLProM) is proposed to encode triangular meshes with arbitrarily complex geometry and topology. In this work, a sequen...
Jingliang Peng, Yan Huang, C.-C. Jay Kuo, Ilya Eck...