1091 search results - page 108 / 219 » Approximation Algorithms for Data Placement Problems |
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
SECON
2010
IEEE
13 years 5 months ago
2010
IEEE
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...