87 search results - page 13 / 18 » Nearest Singular Polynomials |
TCC
2007
Springer
14 years 1 months 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...
AUIC
2006
IEEE
14 years 1 months ago
2006
IEEE
We describe a prototype sketch-based system that allows users to draw and manipulate directed graphs using gestural input exclusively. The system incorporates the notion of fluid...
EOR
2007
13 years 7 months ago
2007
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
WALCOM
2007
IEEE
13 years 8 months ago
2007
IEEE
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...