Sciweavers

24680 search results - page 4673 / 4936
» Learning
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 11 months ago
Covert two-party computation
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
Luis von Ahn, Nicholas J. Hopper, John Langford
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 11 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
VLDB
2006
ACM
138views Database» more  VLDB 2006»
14 years 11 months ago
Succinct representation of flexible and privacy-preserving access rights
Abstract We explore the problem of portable and flexible privacy preserving access rights that permit access to a large collection of digital goods. Privacy-preserving access contr...
Marina Blanton, Mikhail J. Atallah
VLDB
2007
ACM
118views Database» more  VLDB 2007»
14 years 11 months ago
Inferring XML Schema Definitions from XML Data
Although the presence of a schema enables many optimizations for operations on XML documents, recent studies have shown that many XML documents in practice either do not refer to ...
Geert Jan Bex, Frank Neven, Stijn Vansummeren
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
14 years 11 months ago
FPGA: what's in it for a database?
While there seems to be a general agreement that next years' systems will include many processing cores, it is often overlooked that these systems will also include an increa...
Jens Teubner, René Müller
« Prev « First page 4673 / 4936 Last » Next »