2233 search results - page 216 / 447 » On the Complexity of Theory Curbing |
183
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
135
click to vote
ECCC
2007
15 years 6 months ago
2007
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
154
click to vote
EOR
2007
15 years 6 months ago
2007
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
206
click to vote
TALG
2008
15 years 6 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
164
click to vote
JCT
2007
15 years 6 months ago
2007
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...