58 search results - page 9 / 12 » Two Families of Algorithms for Symbolic Polynomials |
150
click to vote
JCT
2008
15 years 5 months ago
2008
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
196
click to vote
MOBICOM
2006
ACM
15 years 11 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
171
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
157
click to vote
CPM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
183
click to vote
WINE
2005
Springer
15 years 11 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...