1383 search results - page 246 / 277 » On the Complexity of the Interlace Polynomial |
109
click to vote
SSS
2010
Springer
15 years 6 days ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
118
Voted
WIOPT
2010
IEEE
15 years 6 days ago
2010
IEEE
—In this paper, we explore physical layer cooperative communication in order to design network layer routing algorithms that are energy efficient. We assume each node in the net...
135
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
162
click to vote
NC
2011
14 years 8 months ago
2011
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
135
click to vote
TSP
2011
14 years 8 months ago
2011
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...