5624 search results - page 1010 / 1125 » On Conditional Covering Problem |
ICDT
2009
ACM
14 years 10 months ago
2009
ACM
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
SPAA
2009
ACM
14 years 10 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
KDD
2007
ACM
14 years 10 months ago
2007
ACM
Accurate localization of mobile objects is a major research problem in sensor networks and an important data mining application. Specifically, the localization problem is to deter...
KDD
2007
ACM
14 years 10 months ago
2007
ACM
We briefly survey several privacy compromises in published datasets, some historical and some on paper. An inspection of these suggests that the problem lies with the nature of the...
KDD
2006
ACM
14 years 10 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...