1379 search results - page 70 / 276 » The Complexity of the Annihilating Polynomial |
103
click to vote
ICC
2008
IEEE
15 years 7 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
133
Voted
CSR
2007
Springer
15 years 6 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
105
Voted
ICDT
2007
ACM
15 years 6 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
121
click to vote
ACNS
2011
Springer
14 years 4 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...
116
Voted
INFOCOM
2012
IEEE
13 years 3 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...