Sciweavers

3122 search results - page 11 / 625
» A Theory of Network Equivalence
Sort
View
98
Voted
TACS
2001
Springer
15 years 2 months ago
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel sy...
Ph. Schnoebelen
IJCV
2000
116views more  IJCV 2000»
14 years 9 months ago
Equivalence of Julesz Ensembles and FRAME Models
In the past thirty years, research on textures has been pursued along two different lines. The first line of research, pioneered by Julesz (1962, IRE Transactions of Information Th...
Ying Nian Wu, Song Chun Zhu, Xiuwen Liu
CONCUR
2006
Springer
15 years 1 months ago
On Finite Alphabets and Infinite Bases III: Simulation
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
Taolue Chen, Wan Fokkink
INFOCOM
2008
IEEE
15 years 4 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
PE
2002
Springer
176views Optimization» more  PE 2002»
14 years 9 months ago
Effective bandwidth estimation and testing for Markov sources
This work addresses the resource sharing problem in broadband communication networks that can guarantee some quality of service (QoS), and develops some results about data source ...
Juan Pechiar, Gonzalo Perera, María Simon