Sciweavers

2680 search results - page 329 / 536
» The topology of the independence complex
Sort
View
LATIN
2010
Springer
15 years 9 days ago
Packet Routing on the Grid
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...
Britta Peis, Martin Skutella, Andreas Wiese
PVLDB
2010
110views more  PVLDB 2010»
15 years 8 days ago
Graph Homomorphism Revisited for Graph Matching
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 ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
RSA
2010
89views more  RSA 2010»
15 years 8 days ago
Some remarks on Betti numbers of random polygon spaces
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...
Clément Dombry, Christian Mazza
135
Voted
TDSC
2010
101views more  TDSC 2010»
15 years 7 days ago
Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks
—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 ...
164
Voted
CGF
2010
179views more  CGF 2010»
15 years 5 days ago
Feature Oriented Progressive Lossless Mesh Coding
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...