1254 search results - page 134 / 251 » Making Hard Problems Harder |
STOC
2010
ACM
14 years 2 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
KDD
2010
ACM
14 years 2 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
ATAL
2006
Springer
14 years 2 months ago
2006
Springer
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
ATAL
2006
Springer
14 years 2 months ago
2006
Springer
Selecting the right parties to interact with is a fundamental problem in open and dynamic environments. The problem is exemplified when the number of interacting parties is high a...