Sciweavers

948 search results - page 119 / 190
» What can we achieve by arbitrary announcements
Sort
View
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
14 years 9 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
SIGMOD
2002
ACM
181views Database» more  SIGMOD 2002»
14 years 9 months ago
Archiving scientific data
This report is part of the seminar Digital Information Curation held by Prof. Dr. Marc H. Scholl and Dr. Andr?e Seifert during the winter term 2005/06. Its intention is to summari...
Peter Buneman, Sanjeev Khanna, Keishi Tajima, Wang...
MIS
2004
Springer
162views Multimedia» more  MIS 2004»
14 years 2 months ago
Integrating the Results of Multimedia Sub-Queries Using Qualitative Preferences
When similarity queries over multimedia databases are processed by splitting the overall query condition into a set of sub-queries, the problem of how to efficiently and effectiv...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
WWW
2003
ACM
14 years 9 months ago
Evaluation of edge caching/offloading for dynamic content delivery
As dynamic content becomes increasingly dominant, it becomes an important research topic as how the edge resources such as client-side proxies, which are otherwise underutilized f...
Chun Yuan, Yu Chen, Zheng Zhang
IPCCC
2006
IEEE
14 years 2 months ago
dRamDisk: efficient RAM sharing on a commodity cluster
Recent work on distributed RAM sharing has largely focused on leveraging low-latency networking technologies to optimize remote memory access. In contrast, we revisit the idea of ...
Vassil Roussev, Golden G. Richard III, Daniel Ting...