2446 search results - page 134 / 490 » Choiceless Polynomial Time |
127
Voted
RECOMB
2002
Springer
16 years 1 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...
106
click to vote
STOC
2005
ACM
16 years 1 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...
PODS
2008
ACM
16 years 27 days ago
2008
ACM
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
97
Voted
PERCOM
2006
ACM
16 years 11 days ago
2006
ACM
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
88
Voted
MOBIHOC
2008
ACM
16 years 11 days 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...