1379 search results - page 154 / 276 » The Complexity of the Annihilating Polynomial |
186
click to vote
RECOMB
2002
Springer
16 years 6 months ago
2002
Springer
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
165
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
147
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
185
click to vote
VMCAI
2009
Springer
16 years 1 months ago
2009
Springer
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
160
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...