Sciweavers

394 search results - page 56 / 79
» Computing Minimal Polynomials of Matrices
Sort
View
137
Voted
STACS
1993
Springer
15 years 4 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
15 years 6 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
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...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
15 years 7 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
SIAMMAX
2010
104views more  SIAMMAX 2010»
14 years 7 months ago
The Legendre-Fenchel Conjugate of the Product of Two Positive Definite Quadratic Forms
It is well-known that the Legendre-Fenchel conjugate of a positive definite quadratic form can be explicitly expressed as another positive definite quadratic form, and that the con...
Yun-Bin Zhao
106
Voted
TIT
2008
83views more  TIT 2008»
15 years 11 days ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck