10608 search results - page 636 / 2122 » Complexity of O'Hara's Algorithm |
212
click to vote
FSTTCS
2010
Springer
15 years 5 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
196
click to vote
ICASSP
2009
IEEE
15 years 5 months ago
2009
IEEE
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
190
click to vote
TCS
2010
15 years 1 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
203
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
177
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...