588 search results - page 90 / 118 » Reducibility and Completeness in Private Computations |
SIGCOMM
2009
ACM
15 years 6 months ago
2009
ACM
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
106
click to vote
PCI
2005
Springer
15 years 5 months ago
2005
Springer
Cache misses form a major bottleneck for memory-intensive applications, due to the significant latency of main memory accesses. Loop tiling, in conjunction with other program tran...
112
click to vote
ECML
2003
Springer
15 years 5 months ago
2003
Springer
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
NJC
2006
14 years 11 months ago
2006
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
105
click to vote
TROB
2002
14 years 11 months ago
2002
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...