1383 search results - page 72 / 277 » On the Complexity of the Interlace Polynomial |
185
click to vote
ACNS
2011
Springer
14 years 9 months ago
2011
Springer
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
177
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
140
click to vote
JSC
2007
15 years 6 months ago
2007
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
138
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
176
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...