Sciweavers

522 search results - page 8 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
ISCC
2005
IEEE
15 years 5 months ago
A Game Theoretic Analysis of Protocols Based on Fountain Codes
In this paper we analyze a novel paradigm of reliable communications which is not based on the traditional timeout-and-retransmit mechanism of TCP. Our approach, which we call FBP...
Luis López, Antonio Fernández, Vicen...
CN
2007
103views more  CN 2007»
14 years 11 months ago
A game theoretic comparison of TCP and digital fountain based protocols
In this paper we analyze a novel paradigm of reliable communication which is not based on the traditional timeout-andretransmit mechanism of TCP. Our approach, which we call Fount...
Luis López, Antonio Fernández, Vicen...
COMPLEX
2009
Springer
15 years 6 months ago
Comparing Networks from a Data Analysis Perspective
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
Wei Li, Jing-Yu Yang
ECAI
2000
Springer
15 years 3 months ago
Learning Efficiently with Neural Networks: A Theoretical Comparison between Structured and Flat Representations
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
Marco Gori, Paolo Frasconi, Alessandro Sperduti
DM
2011
264views Education» more  DM 2011»
14 years 6 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat