3937 search results - page 254 / 788 » Questioning Ubiquitous Computing |
173
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
164
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
167
click to vote
SIAMCOMP
2011
14 years 11 months ago
2011
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
223
click to vote
EDBT
2012
ACM
13 years 6 months ago
2012
ACM
We present some architectural and technological insights on SAP’s HANA database and derive research challenges for future enterprise application development. The HANA database m...
253
click to vote
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...