13603 search results - page 2646 / 2721 » On the Computational Complexity of Cut-Reduction |
117
click to vote
SIGMETRICS
2010
ACM
15 years 2 months ago
2010
ACM
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating co...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
CSR
2010
Springer
15 years 2 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
116
click to vote
EDCC
2010
Springer
15 years 2 months ago
2010
Springer
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...