330 search results - page 61 / 66 » Algorithms for Propositional Model Counting |
107
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
101
Voted
ICDM
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we devise an efficient algorithm for clustering market-basket data. Different from those of the traditional data, the features of market-basket data are known to b...
125
Voted
WWW
2009
ACM
16 years 1 months ago
2009
ACM
Several attempts have been made to analyze customer behavior on online E-commerce sites. Some studies particularly emphasize the social networks of customers. Users' reviews ...
82
Voted
WWW
2008
ACM
16 years 1 months ago
2008
ACM
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
109
Voted
AMAI
1999
Springer
15 years 24 days ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...