995 search results - page 130 / 199 » complexity 2011 |
150
click to vote
DCC
2011
IEEE
14 years 10 months ago
2011
IEEE
We show that (n, 2n ) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to ...
233
click to vote
DISOPT
2011
14 years 10 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
271
Voted
ECCC
2011
14 years 10 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
171
Voted
IS
2011
14 years 10 months ago
2011
—It is common for large and complex organizations to maintain repositories of business process models in order to document and to continuously improve their operations. Given suc...
151
Voted
MST
2011
14 years 10 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...