1379 search results - page 92 / 276 » The Complexity of the Annihilating Polynomial |
188
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
157
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we study the eigenvalue-based spectrum sensing techniques for multiple-antenna cognitive radio networks. First, we study the extreme eigenvalue distributions of a c...
147
click to vote
CCS
2007
ACM
16 years 14 days ago
2007
ACM
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...
183
click to vote
JMLR
2006
15 years 6 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
156
click to vote
CADE
2009
Springer
16 years 1 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...