1743 search results - page 222 / 349 » Generalized Modal Satisfiability |
117
Voted
CCS
2009
ACM
16 years 5 months ago
2009
ACM
Despite several research studies, the effective analysis of policy based systems remains a significant challenge. Policy analysis should at least (i) be expressive (ii) take accou...
134
Voted
MOBISYS
2009
ACM
16 years 5 months ago
2009
ACM
In this paper, we present the design and evaluation of a nearfield communication-based mobile p2p payment application called mFerio which is designed to replace cash-based transac...
140
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Clustering with constraints is an emerging area of data mining research. However, most work assumes that the constraints are given as one large batch. In this paper we explore the...
135
Voted
KDD
2006
ACM
16 years 4 months ago
2006
ACM
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
136
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...