Sciweavers

73 search results - page 8 / 15
» Labeling Schemes for Vertex Connectivity
Sort
View
CN
2006
75views more  CN 2006»
13 years 7 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
CGF
2010
179views more  CGF 2010»
13 years 6 months 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...
DCC
2006
IEEE
14 years 7 months ago
Time-Sharing Vs. Source-Splitting in the Slepian-Wolf Problem: Error Exponents Analysis
We discuss two approaches for decoding at arbitrary rates in the Slepian-Wolf problem - time sharing and source splitting - both of which rely on constituent vertex decoders. We c...
Michelle Effros, Muriel Médard, Todd P. Col...
ICCAD
2005
IEEE
81views Hardware» more  ICCAD 2005»
14 years 4 months ago
Kauffman networks: analysis and applications
Abstract— A Kauffman network is an abstract model of gene regulatory networks. Each gene is represented by a vertex. An edge from one vertex to another implies that the former ge...
Elena Dubrova, Maxim Teslenko, Andrés Marti...
INFOCOM
2002
IEEE
14 years 23 days ago
Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman