5056 search results - page 257 / 1012 » Network Coding Theory |
125
Voted
SODA
2010
ACM
16 years 27 days ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
108
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
DSD
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we propose an approach to the reduction of sizes of Multi-Terminal Binary Decision Diagrams (MTBDDs) [3] by using the copy properties of discrete functions. The und...
140
Voted
FUIN
1998
15 years 3 months ago
1998
The technique of image compression using Iterative Function System (IFS) is known as fractal image compression. An extension of IFS theory is called as Partitioned or local Iterati...
143
Voted
ISOLA
2010
Springer
15 years 2 months ago
2010
Springer
According to the theory of Network Calculus based on the (min,+) algebra, analysis and measure of worst-case performance in communication networks can be made easily. In this conte...