1998 search results - page 234 / 400 » Complexity of the Cover Polynomial |
167
click to vote
CGA
1998
15 years 6 months ago
1998
This paper describes methods and data structures used to leverage motion sequences of complex linked figures. We present a technique for interpolating between example motions der...
168
click to vote
JUCS
2010
15 years 5 months ago
2010
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
187
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
184
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...
170
click to vote
SIGECOM
2006
ACM
16 years 16 days ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...