1379 search results - page 161 / 276 » The Complexity of the Annihilating Polynomial |
205
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
221
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
166
click to vote
TCC
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
222
click to vote
TCC
2007
Springer
16 years 16 days ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
189
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...