3378 search results - page 580 / 676 » A universe of binding and computation |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
117
click to vote
CHI
2005
ACM
15 years 10 months ago
2005
ACM
In this paper we introduce the idea of organizing systems. Through a number of examples from an ongoing ethnographic study of family life, we suggest that organizing systems come ...
167
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...