588 search results - page 88 / 118 » Reducibility and Completeness in Private Computations |
ASPDAC
2008
ACM
13 years 12 months ago
2008
ACM
In this paper, we present the complete design and architectural details of MAIZEROUTER. MAIZEROUTER reflects a significant leap in progress over existing publicly available routing...
CSCW
2008
ACM
13 years 11 months ago
2008
ACM
Wikipedia's success is often attributed to involving large numbers of contributors who improve the accuracy, completeness and clarity of articles while reducing bias. However...
BXML
2004
13 years 11 months ago
2004
: Whenever transformation of data is used to bridge the gap of different data formats, and a query is given in the destination format, query reformulation can speed up the transfor...
EJC
2008
13 years 10 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
FTTCS
2006
13 years 10 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...