1941 search results - page 338 / 389 » On the Hardness of Approximate Reasoning |
122
click to vote
POPL
2010
ACM
15 years 9 months ago
2010
ACM
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
SPAA
2009
ACM
15 years 9 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
SOSP
2003
ACM
15 years 8 months ago
2003
ACM
Peer-to-peer storage systems assume that their users consume resources in proportion to their contribution. Unfortunately, users are unlikely to do this without some enforcement m...
101
click to vote
SOSP
2005
ACM
15 years 8 months ago
2005
ACM
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We introduce a parametric version (pDRUR) of the recently proposed Dimensionality Reduction by Unsupervised Regression algorithm. pDRUR alternately minimizes reconstruction error ...