Sciweavers

844 search results - page 1 / 169
» A Polynomial Algorithm for Codes Based on Directed Graphs
Sort
View
CATS
2006
13 years 6 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev
IPCCC
2007
IEEE
13 years 11 months ago
On Network Coding Based Multirate Video Streaming in Directed Networks
This paper focuses on network coding based multirate multimedia streaming in directed networks and aims at maximizing the total layers received by all receivers, which directly de...
Chen-guang Xu, Yinlong Xu, Cheng Zhan, Ruizhe Wu, ...
STACS
2005
Springer
13 years 10 months ago
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
Telikepalli Kavitha, Kurt Mehlhorn
ECCV
2004
Springer
14 years 6 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...
JGAA
2007
123views more  JGAA 2007»
13 years 4 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta